Shortest Path Solvers. From Software to Wetware (Record no. 78608)

000 -LEADER
fixed length control field 04279nam a22005655i 4500
001 - CONTROL NUMBER
control field 978-3-319-77510-4
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220801220456.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 180426s2018 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783319775104
-- 978-3-319-77510-4
082 04 - CLASSIFICATION NUMBER
Call Number 515.39
245 10 - TITLE STATEMENT
Title Shortest Path Solvers. From Software to Wetware
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2018.
300 ## - PHYSICAL DESCRIPTION
Number of Pages VIII, 441 p. 187 illus., 90 illus. in color.
490 1# - SERIES STATEMENT
Series statement Emergence, Complexity and Computation,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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.
520 ## - SUMMARY, ETC.
Summary, etc 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. .
700 1# - AUTHOR 2
Author 2 Adamatzky, Andrew.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-319-77510-4
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2018.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Dynamics.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Nonlinear theories.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational intelligence.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Applied Dynamical Systems.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational Intelligence.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2194-7295 ;
912 ## -
-- ZDB-2-ENG
912 ## -
-- ZDB-2-SXE

No items available.