Shortest Path Solvers. from Software to Wetware - Couverture rigide

9783319775098: Shortest Path Solvers. from Software to Wetware

Couverture rigide

ISBN 10 : 331977509X ISBN 13 : 9783319775098

Editeur : Springer International Publishing AG, 2018

Afficher les exemplaires de cette �dition comportant l?ISBN

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.- Inﬂuenza 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.

� propos de l?auteur

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteurSpringer International Publishing AG
Date d'�dition2018
ISBN 10 331977509X
ISBN 13 9783319775098
ReliureReli�
Langueanglais
Num�ro d'�dition1
Nombre de pages441
�diteurAdamatzky Andrew
Coordonn�es du fabricantnon disponible

Acheter neuf

Afficher cet article

EUR 93

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783030084738: Shortest Path Solvers. From Software to Wetware

Edition pr�sent�e

ISBN 10 : 3030084736 ISBN 13 : 9783030084738
Editeur : Springer, 2019
Couverture souple

R�sultats de recherche pour Shortest Path Solvers. from Software to Wetware

Image fournie par le vendeur

Shortest Path Solvers. From Software to Wetware

Adamatzky, Andrew

Edit� par Springer International Publishing, 2018

ISBN 10 : 331977509X ISBN 13 : 9783319775098

Neuf Couverture rigide

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

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&nbspPresents novel and unique algorithms of solving shortest . N� de r�f. du vendeur 208990780

Contacter le vendeur

Acheter neuf

EUR 93

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Shortest Path Solvers. From Software to Wetware

Andrew Adamatzky

Edit� par Springer International Publishing, 2018

ISBN 10 : 331977509X ISBN 13 : 9783319775098

Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N� de r�f. du vendeur 9783319775098

Contacter le vendeur

Acheter neuf

EUR 106,99

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Shortest Path Solvers. From Software to Wetware

Andrew Adamatzky

Edit� par Springer International Publishing Mai 2018, 2018

ISBN 10 : 331977509X ISBN 13 : 9783319775098

Neuf Couverture rigide

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

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

Contacter le vendeur