Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Markov Chain Models for Stochastic Shortest Path Problem
Angličtina
73 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
/
Kalendář
1 243
Kč
/
Brožovaná
144
Kč
/
Brožovaná
336
Kč
The Markov stochastic process is used to model lots of optimization problems, especially in the network optimization problems. In the routing optimization problems there could be either continuous or discrete parameters in the networks. Suppose the length of an arc is defined as the time that takes to transmit flow between the pair linked nodes of the arc; then, in this situation the cost parameters of the network are continuous variables and it may be modeled by a continuous time Markov chain (CTMC) stochastic process. In other situation consider the topology of the network that shows the location of the nodes and their related linked arcs; so, a connecting path from a given source node to a given destination node may be modeled by a discrete time Markov chain (DTMC) stochastic process. Then, some stochastic routing models in the networks with an established Markov stochastic process are discussed. So, a new criterion will be presented for the probabilistic evaluation of the message transmission between two given nodes by time T, which is applicable for large size networks. Then, a genetic algorithm is performed to find the best established connection.
Informace o knize
Angličtina
Kategorie
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
381
Kč
/
Brožovaná
1 933
Kč
/
Brožovaná
369
Kč
