An approximation algorithm based on leap condition for stochastical simulation of biomedical systems

Date

2008-06-01

Author

Purutçuoğlu Gazi, Vilda

Metadata

Show full item record

Item Usage Stats

63
views

0
downloads

URI

https://hdl.handle.net/11511/80419

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

An iterative approximation scheme for repetitive Markov processes Tüfekçi, Tolga; Güllü, Refik (Cambridge University Press (CUP), 1999-09-01) Repetitive Markov processes form a class of processes where the generator matrix has a particular repeating form. Many queueing models fall in this category such as M/M/1 queues, quasi-birth-and-death processes, and processes with M/G/1 or GI/M/1 generator matrices. in this paper, a new iterative scheme is proposed for computing the stationary probabilities of such processes. An infinite state process is approximated by a finite state process by lumping an infinite number of states into a super-state. What ...
An online sequential algorithm for the estimation of transition probabilities forjump Markov linear systems Orguner, Umut (Elsevier BV, 2006-10-01) This paper describes a new method to estimate the transition probabilities associated with a jump Markov linear system. The new algorithm uses stochastic approximation type recursions to minimize the Kullback-Leibler divergence between the likelihood function of the transition probabilities and the true likelihood function. Since the calculation of the likelihood function of the transition probabilities is impossible, an incomplete data paradigm, which has been previously applied to a similar problem for hi...
An interactive approximation algorithm for multi-objective integer programs Lokman, Banu; Korhonen, Pekka J.; Wallenius, Jyrki (2018-08-01) We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quasiconcave value function. Using pairwise comparisons of the DM, we construct convex cones and eliminate the inferior regions that are close to being dominated by the cones in addition to the regions dominated by the cones. The algorithm allows the DM to change th...
An exponential big bang-big crunch algorithm for discrete design optimization of steel frames Hasançebi, Oğuzhan (2012-11-01) In the present study an enhanced variant of the big bang-big crunch (BB-BC) technique, namely exponential BB-BC algorithm (EBB-BC) is developed for code based design optimization of steel frame structures. It is shown that the standard version of the BB-BC algorithm is sometimes unable to produce reasonable solutions to problems from discrete design optimization of steel frames. Hence, through investigating the shortcomings of BB-BC algorithm, it is aimed to reinforce the performance of the technique for th...
An indexing technique for similarity-based fuzzy object-oriented data model Yazıcı, Adnan; Koyuncu, M (2004-01-01) Fuzzy object-oriented data model is a fuzzy logic-based extension to object-oriented database model, which permits uncertain data to be explicitly represented. One of the proposed fuzzy object-oriented database models based on similarity relations is the FOOD model. Several kinds of fuzziness are dealt with in the FOOD model, including fuzziness between object/class and class/superclass relations. The traditional index structures are inappropriate for the FOOD model for an efficient access to the objects wi...

Citation Formats

V. Purutçuoğlu Gazi, “An approximation algorithm based on leap condition for stochastical simulation of biomedical systems,” 2008, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/80419.