國立虎尾科技大學 |

Shortest path solvers = from software to wetware /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Shortest path solvers/ edited by Andrew Adamatzky.
其他題名:	from software to wetware /
其他作者:	Adamatzky, Andrew.
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	viii, 441 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
標題:	Computer algorithms. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-77510-4
ISBN:	9783319775104

Shortest path solvers = from software to wetware /
Shortest path solversfrom software to wetware /[electronic resource] :edited by Andrew Adamatzky. - Cham :Springer International Publishing :2018. - viii, 441 p. :ill., digital ;24 cm. - Emergence, complexity and computation,v.322194-7287 ;. - Emergence, complexity and computation ;v.5..

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.

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.

ISBN: 9783319775104

Standard No.: 10.1007/978-3-319-77510-4doiSubjects--Topical Terms:

528448
Computer algorithms.

LC Class. No.: QA76.9.A43 / S567 2018

Dewey Class. No.: 006.3824

Shortest path solvers = from software to wetware /
LDR:03303nam a2200325 a 4500 001 925780
003 DE-He213
005 20181109164911.0
006 m d
007 cr nn 008maaau
008 190625s2018 gw s 0 eng d
020 $a 9783319775104 $q (electronic bk.)
020 $a 9783319775098 $q (paper)
024 7 $a 10.1007/978-3-319-77510-4 $2 doi
035 $a 978-3-319-77510-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b S567 2018
072 7 $a GPFC $2 bicssc
072 7 $a TEC000000 $2 bisacsh
082 0 4 $a 006.3824 $2 23
090 $a QA76.9.A43 $b S559 2018
245 0 0 $a Shortest path solvers $h [electronic resource] : $b from software to wetware / $c edited by Andrew Adamatzky.
260 $a Cham : $c 2018. $b Springer International Publishing : $b Imprint: Springer,
300 $a viii, 441 p. : $b ill., digital ; $c 24 cm.
490 1 $a Emergence, complexity and computation, $x 2194-7287 ; $v v.32
505 0 $a 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.
520 $a 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.
650 0 $a Computer algorithms. $3 528448
650 0 $a Cellular automata. $3 574251
650 0 $a Mathematical optimization. $3 527675
650 1 4 $a Engineering. $3 561152
650 2 4 $a Complexity. $3 669595
650 2 4 $a Computational Intelligence. $3 768837
700 1 $a Adamatzky, Andrew. $3 670221
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a Emergence, complexity and computation ; $v v.5. $3 1019415
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-77510-4
950 $a Engineering (Springer-11647)