Shortest Path Solvers. From Software to Wetware

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Adamatzky, Andrew (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: Emergence, Complexity and Computation, 32
• Θέματα: Computational complexity.; Computational intelligence.; Complexity.; Computational Intelligence.

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...

Πίνακας περιεχομένων:

• 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.