设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet S (Sa, Sb,Sc, Sd, Se…... )

1234567下一页
返回列表

Titlebook: Shortest Path Solvers. From Software to Wetware; Andrew Adamatzky Book 2018 Springer International Publishing AG, part of Springer Nature

[复制链接]
查看: 54893|回复: 60
发表于 2025-3-21 19:22:14 | 显示全部楼层 |阅读模式
书目名称Shortest Path Solvers. From Software to Wetware
编辑Andrew Adamatzky
视频video
概述Comprehensively addresses the famous problem of shortest path solving in the context of computer science, network theory, operational systems, swarm robotics, and graph theory.Presents novel and uniqu
丛书名称Emergence, Complexity and Computation
图书封面Titlebook: Shortest Path Solvers. From Software to Wetware; Andrew Adamatzky Book 2018 Springer International Publishing AG, part of Springer Nature
描述.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 moul
出版日期Book 2018
关键词Unconventional Computing; Natural Computation; Evolutionary Algorithms; Genetic Programming; Bio-inspire
版次1
doihttps://doi.org/10.1007/978-3-319-77510-4
isbn_softcover978-3-030-08473-8
isbn_ebook978-3-319-77510-4Series ISSN 2194-7287 Series E-ISSN 2194-7295
issn_series 2194-7287
copyrightSpringer International Publishing AG, part of Springer Nature 2018
The information of publication is updating

书目名称Shortest Path Solvers. From Software to Wetware影响因子(影响力)




书目名称Shortest Path Solvers. From Software to Wetware影响因子(影响力)学科排名




书目名称Shortest Path Solvers. From Software to Wetware网络公开度




书目名称Shortest Path Solvers. From Software to Wetware网络公开度学科排名




书目名称Shortest Path Solvers. From Software to Wetware被引频次




书目名称Shortest Path Solvers. From Software to Wetware被引频次学科排名




书目名称Shortest Path Solvers. From Software to Wetware年度引用




书目名称Shortest Path Solvers. From Software to Wetware年度引用学科排名




书目名称Shortest Path Solvers. From Software to Wetware读者反馈




书目名称Shortest Path Solvers. From Software to Wetware读者反馈学科排名




单选投票, 共有 0 人参与投票
1.jpg
 

0票 0%

Perfect with Aesthetics
2.jpg
 

0票 0%

Better Implies Difficulty
3.jpg
 

0票 0%

Good and Satisfactory
4.jpg
 

0票 0%

Adverse Performance
5.jpg
 

0票 0%

Disdainful Garbage
您所在的用户组没有投票权限
会议记录
回复

举报

发表于 2025-3-21 22:28:18 | 显示全部楼层
Practical Algorithms for the All-Pairs Shortest Path Problem,vestigate the highly related all-pairs bottleneck paths problem, and give an efficient average case algorithm. On top of that, we show how the bottleneck paths problem relates to the decremental transitive closure problem, and specifically how algorithms for the latter can be used to solve the former.
绕着哥哥问
回复

举报

发表于 2025-3-22 00:42:55 | 显示全部楼层
facilitate
回复

举报

发表于 2025-3-22 05:35:35 | 显示全部楼层
Shortest Path Finding in Mazes by Active and Passive Particles,rface tension driven phenomena at the air-liquid interface. We show that maze solving can be implemented by using: (i) active (self-propelled) droplets and/or (ii) passive particles (chemical entities).
不公开
回复

举报

发表于 2025-3-22 10:11:45 | 显示全部楼层
nauseate
回复

举报

发表于 2025-3-22 15:53:31 | 显示全部楼层
A Parallel Algorithm for the Constrained Shortest Path Problem on Lattice Graphs, shortest path whose total weight is smaller than a pre-determined value. In each step the processing elements are not analyzing the entire graph. Instead they are focusing on a subset of vertices called .. The set of active vertices at time . is related to the boundary of the ball . of radius . in
engender
回复

举报

发表于 2025-3-22 17:51:49 | 显示全部楼层
Gathering a Swarm of Robots Through Shortest Paths,nitially placed at different locations toward a common point. Robots move based on the so called Look-Compute-Move model. Each time a robot wakes up, it perceives the current configuration in terms of robots’ positions (Look), it decides whether and where to move (Compute), and makes the computed mo
Systemic
回复

举报

发表于 2025-3-22 22:23:21 | 显示全部楼层
lattice
回复

举报

发表于 2025-3-23 03:55:27 | 显示全部楼层
后天习得
回复

举报

发表于 2025-3-23 09:24:18 | 显示全部楼层
帽子
回复

举报

下一页 »
1234567下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-19 06:47
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表