00000cmm a22000004i 4500 UP-99796217613391851 Buklod 20200614130232.0 m |o d | cr cu|mmmmuaua 180426s2018 xx o u | eng d 9783319775104 (online ISBN) (iLib)UPD-00516571024 WaSeSS DENGII rda eng QA 76.9 M35 S56 2018eb Shortest path solvers. from software to wetware Andrew Adamatzky, editor. Cham Springer International Publishing [2018] 1 online resource. text rdacontent computer rdamedia online resource rdacarrier Emergence, Complexity and Computation 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. IP-based subscription, on campus and remote access. Access via Electronic Resources of the UPD Engineering Library and University Library websites. Electronic reproduction. Cham Springer International Publishing 2018. Available via World Wide Web through SpringerLink. Engineering. Computational intelligence. Complexity, Computational. Electronic books. Adamatzky, Andrew editor. SpringerLink (Online service). Available for University of the Philippines System via SpringerLink. Click here to access https://doi.org/10.1007/978-3-319-77510-4 Also available remotely for University of the Philippines System via SpringerLink. Click here to access thru EZproxy https://://link.springer.com.ezproxy.engglib.upd.edu.ph/book/10.1007/978-3-319-77510-4 (viewed 14 June 2020) FO UPD DENG-II Electronic Resource