Condizione: New. pp. 118.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New.
Da: Majestic Books, Hounslow, Regno Unito
EUR 70,31
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 118.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 72,01
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 118.
Lingua: Inglese
Editore: Springer International Publishing, 2015
ISBN 10: 3319196790 ISBN 13: 9783319196794
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloKartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Pouya Baniasadi is a doctoral student in mathematics at Flinders University, Australia. He is a recipient of the AF Pillow Applied Mathematics Scholarship from the AF Pillow Mathematics Trust, Australia.Vladimir Ejov is the leader of the Mathemati.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 99,90
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In 1992, it was demonstrated that the Hamiltonian cycle problem (HCP) may be embedded in a Markov decision process (MDP). This breakthrough enabled a number of new theoretical and algorithmic developments for HCP. In particular, optimisation models which are equivalent to HCP were constructed. However, the development of numerical procedures based on these models has lagged the rapid development of new theory. In this monograph, we progress a number of new algorithmic approaches that take advantage of the MDP perspective. The work presented within is separated into three primary chapters, each describing a different algorithmic approach to solving HCP. 344 pp. Englisch.
Da: moluna, Greven, Germania
EUR 79,01
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Haythorpe MichaelDr. Michael Haythorpe completed his PhD in July, 2010 at University of South Australia, Adelaide. His research interests lie in graph theory, complexity, numerical optimisation and algorithm development. He currently.
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 99,90
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In 1992, it was demonstrated that the Hamiltonian cycle problem (HCP) may be embedded in a Markov decision process (MDP). This breakthrough enabled a number of new theoretical and algorithmic developments for HCP. In particular, optimisation models which are equivalent to HCP were constructed. However, the development of numerical procedures based on these models has lagged the rapid development of new theory. In this monograph, we progress a number of new algorithmic approaches that take advantage of the MDP perspective. The work presented within is separated into three primary chapters, each describing a different algorithmic approach to solving HCP.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 344 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 157,52
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 99,90
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In 1992, it was demonstrated that the Hamiltonian cycle problem (HCP) may be embedded in a Markov decision process (MDP). This breakthrough enabled a number of new theoretical and algorithmic developments for HCP. In particular, optimisation models which are equivalent to HCP were constructed. However, the development of numerical procedures based on these models has lagged the rapid development of new theory. In this monograph, we progress a number of new algorithmic approaches that take advantage of the MDP perspective. The work presented within is separated into three primary chapters, each describing a different algorithmic approach to solving HCP.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 160,12
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.