Free delivery for orders over 69.99€

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

Speedy courier 3.99 € Speedy point 3.99 € Еконт courier 4.49 € Еконтомат/Офис на Еконт 4.49 € Ekont Box 4.49 € Sameday courier 4.49 € Sameday Box 4.49 € Box Now 4.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99€

Markov Chain Models for Stochastic Shortest Path Problem

Name: Markov Chain Models for Stochastic Shortest Path Problem
Brand: LAP Lambert Academic Publishing
SKU: 16300804
Price: 31.88 EUR
Availability: InStock
Author: Mohsen Abdolhosseinzadeh
ISBN: 9783330071346

Mohsen Abdolhosseinzadeh

Gholam Hassan Shirdel

Language

English

Book Paperback

Libristo code: 16300804

Publishers LAP Lambert Academic Publishing, November 2016

The Markov stochastic process is used to model lots of optimization problems, especially in the netw... Full description

Libristo code: 16300804

78 b

31.88 €

62.36 лв

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Jekologicheskaya bezopasnost' Rossijskogo gosudarstva Valerij Kuz'min

Paperback

43.08 € 84.25 лв

Sprigiona il valore! Made in Carcere e la rivoluzione del Benessere Interno Lordo

Paperback

36.25 € 70.90 лв

Mini potterovky: Hermiona Grangerová Joanne K. Rowling

Hardback

14.22 € 27.81 лв

5 resetów. Przeprogramuj mózg i ciało, by uodpornić się na stres Aditi Nerurkar

Paperback

12.17 € 23.79 лв

Robocar Poli - Roy à la rescousse Roi

Hardback

5.85 € 11.44 лв

Si o no Spencer Johnson

Paperback

12.11 € 23.69 лв

Rugby - Histoire et héros du ballon ovale Alberto Bertolazzi

Hardback

36.76 € 71.90 лв

HOURS OF REST OP. 102 PIANO CORNELIUS GURLITT Book

binding.

25.98 € 50.81 лв

THE SLEEP OF THE INFANT JESUS -PARTITION+PARTIES SEPAREES BILL PERCONTI Book

binding.

28.75 € 56.23 лв

Szatan w naszym domu. Kulisy śledztwa w sprawie przemocy rytualnej Lawrence Wright

Hardback

9.29 € 18.17 лв

Wars i Sawa. Czytam sobie. Poziom 1 Wojciech Widłak

Paperback

4.31 € 8.43 лв

"Razblokirowka blokchejna: Innowacii dlq zawtrashnego mira" Pooq Malhotra

Paperback

38.97 € 76.22 лв

Babetta M210–M225 a Korado Zdeno Metzker

Paperback

31.58 € 61.76 лв

Rimbaud, el otro Miguel Casado

Paperback

17.61 € 34.44 лв

Bodengeographie der borealen und kontinentalen Gebiete Eurasiens. Josef Breburda

Paperback

39.07 € 76.42 лв

Vom Aufzeigen und Bewaltigen gesellschaftlicher Konflikte in der mittelhochdeutschen Literatur Lukas Strehle

Paperback

16.99 € 33.23 лв

Naturschutzgebiet Esther Kinsky

Hardback

18.17 € 35.54 лв

Tiergestutzte Interventionen Katrin Schnegelberger

Paperback

37.58 € 73.51 лв

Koncert samoty Maurice Blanchard

Paperback

8.67 € 16.96 лв

CSR in Österreich Eva-Maria Braneti

Paperback

51.96 € 101.63 лв

Le Nouvel Opera de Paris. Volume 2 Charles Garnier

Paperback

30.81 € 60.25 лв

Baiser de La Femme-Araign'e(le) Manuel Puig

Paperback

14.58 € 28.51 лв

7 philosophes qui ont fait le XXᵉ siècle Droit

Paperback

4.62 € 9.03 лв

Salud (medicina y enfermería), basada en la evidencia José Rodrigo Cerrillo

Paperback

41.59 € 81.34 лв

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.