| 000 | 03700nam a22003255i 4500 | ||
|---|---|---|---|
| 001 | 102315 | ||
| 003 | DE-He213 | ||
| 005 | 20230102113035.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 180426s2018 gw | s |||| 0|eng d | ||
| 020 | _a9783319775104 | ||
| 024 | 7 |
_a10.1007/978-3-319-77510-4 _2doi |
|
| 040 |
_aES-MaUEC _bspa |
||
| 050 | _aQA76.9.M35 2018 EB | ||
| 245 | 1 | 0 |
_aShortest Path Solvers. From Software to Wetware _cedited by Andrew Adamatzky. |
| 264 | 1 |
_aCham _bSpringer International Publishing _c2018 |
|
| 300 | _a1 recurso en línea (VIII, 441 páginas 187 ilustraciones, 90 ilustraciones a color) | ||
| 347 |
_atext file _bPDF |
||
| 490 | 0 |
_aEmergence, Complexity and Computation _x2194-7287 _v32 |
|
| 505 | 0 | _aA 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 | 3 | _aThis 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 | 7 |
_aMatemáticas discretas _2embne _9160233 |
|
| 700 | 1 |
_aAdamatzky, Andrew _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt _0http://id.loc.gov/authorities/names/n95020912 _1http://viaf.org/viaf/103118502/ _998020 |
|
| 776 | 0 | 8 |
_iEdición impresa: _z9783319775098 |
| 776 | 0 | 8 |
_iEdición impresa: _z9783319775111 |
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-319-77510-4 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 490 | 0 | _aEngineering (Springer-11647) | |
| 988 | _aEBSPRINGER_2018 | ||
| 998 |
_b01/2019 _dz _ef _feng _ggw _h0 |
||
| 999 |
_c102315 _d102315 _x1 |
||