A parallel algorithm for the constrained shortest path problem on lattice graphs.- Gathering a Swarm of Robots through Shortest Paths.- The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems.- Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks.- Influenza Virus Algorithm for Multiobjective Energy Reduction Open Vehicle Routing Problem.- Computng shortest paths with cellular automata.- Cellular Automata Applications in Shortest Path Problem.- Checkerboard Pattern Formed by Cellular Automata Agents.- Do ants use Ant Colony Optimization.- Slime Mould Inspired Models for Path Planning: Collective and Structural Approaches.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : AwesomeBooks, Wallingford, Royaume-Uni
Hardcover. Etat : Very Good. Shortest Path Solvers. From Software to Wetware: 32 (Emergence, Complexity and Computation, 32) This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. . N° de réf. du vendeur 7719-9783319775098
Quantité disponible : 1 disponible(s)
Vendeur : Bahamut Media, Reading, Royaume-Uni
Hardcover. Etat : Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee. N° de réf. du vendeur 6545-9783319775098
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 86b7a41bde1c6935c3a94e5ee4e2b3fd
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783319775098_new
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book offers advanced parallel and distributed algorithms and experimental laboratory prototypes of unconventional shortest path solvers. In addition, it presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines. The shortest path problem is a fundamental and classical problem in graph theory and computer science and is frequently applied in the contexts of transport and logistics, telecommunication networks, virtual reality and gaming, geometry, and social networks analysis. Software implementations include distance-vector algorithms for distributed path computation in dynamics networks, parallel solutions of the constrained shortest path problem, and application of the shortest path solutions in gathering robotic swarms. Massively parallel algorithms utilise cellular automata, where a shortest path is computed either via matrix multiplication in automaton arrays, or via the representation of data graphs in automaton lattices and using the propagation of wave-like patterns. Unconventional shortest path solvers are presented in computer models of foraging behaviour and protoplasmic network optimisation by the slime mould Physarum polycephalum and fluidic devices, while experimental laboratory prototypes of path solvers using chemical media, flows and droplets, and electrical current are also highlighted. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computers scientists and engineers to chemists and biologists. 452 pp. Englisch. N° de réf. du vendeur 9783319775098
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Comprehensively addresses the famous problem of shortest path solving in the context of computer science, network theory, operational systems, swarm robotics, and graph theory Presents novel and unique algorithms of solving shortest . N° de réf. du vendeur 208990780
Quantité disponible : Plus de 20 disponibles
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. N° de réf. du vendeur V9783319775098
Quantité disponible : 15 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. VIII, 441 187 illus., 90 illus. in color. 1st ed. 2018 edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26384555853
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. VIII, 441 187 illus., 90 illus. in color. N° de réf. du vendeur 379348114
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. VIII, 441 187 illus., 90 illus. in color. N° de réf. du vendeur 18384555847
Quantité disponible : 4 disponible(s)