Reaction‐diffusion and ant‐based load balancing of communication networks
作者： Andrew Adamatzky , Owen Holland
DOI: 10.1108/03684920210428218
关键词:
摘要: Attempts to characterise some aspects of the new wave reaction‐diffusion and ant based computation, discuss their place in class fully distributed load‐balancing algorithms that solve dynamic problem communication networks. The main question paper states: what are advantages intellectualisation control agents costs smartness? We start our investigation with random walk techniques electricity paradigm, carry on approach, finish construction computational hierarchy paradigm smart agents.
emeraldinsight.com 参考文章(19)
Michael Littman, Justin Boyan, A Distributed Reinforcement Learning Scheme for Network Routing Carnegie Mellon University. pp. 55- 61 ,(1993) , 10.4324/9780203773826-9
Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam, Engineering Diffusive Load Balancing Algorithms Using Experiments Lecture Notes in Computer Science. pp. 111- 122 ,(1997) , 10.1007/3-540-63138-0_11
Luca M. Gambardella, Marco Dorigo, Ant-Q: A Reinforcement Learning approach to the traveling salesman problem Machine Learning Proceedings 1995. pp. 252- 260 ,(1995) , 10.1016/B978-1-55860-377-6.50039-6
Ralph Beckers, Owen E. Holland, Jean-Louis Deneubourg, Fom Local Actions to Global Tasks: Stigmergy and Collective Robotics Prerational Intelligence: Adaptive Behavior and Intelligent Systems Without Symbols and Logic, Volume 1, Volume 2 Prerational Intelligence: Interdisciplinary Perspectives on the Behavior of Natural and Artificial Systems, Volume 3. pp. 1008- 1022 ,(2000) , 10.1007/978-94-010-0870-9_63
Dmitrii Tolmachiev, Andrew Adamatzky, Chemical processor for computation of voronoi diagram Advanced Materials for Optics and Electronics. ,vol. 6, pp. 191- 196 ,(1996) , 10.1002/(SICI)1099-0712(199607)6:4<191::AID-AMO238>3.0.CO;2-G
David J. Aldous, The random walk construction of uniform spanning trees and uniform labelled trees SIAM Journal on Discrete Mathematics. ,vol. 3, pp. 450- 465 ,(1990) , 10.1137/0403039
L. Tarassenko, G.F. Marshall, Robot path planning using VLSI resistive grids international conference on artificial neural networks. pp. 163- 167 ,(1993)
Stephen A. Cook, Charles W. Rackoff, Space Lower Bounds for Maze Threadability on Restricted Machines SIAM Journal on Computing. ,vol. 9, pp. 636- 652 ,(1980) , 10.1137/0209048
Ruud Schoonderwoerd, Owen Holland, Janet Bruten, Ant-like agents for load balancing in telecommunications networks adaptive agents and multi-agents systems. pp. 209- 216 ,(1997) , 10.1145/267658.267718
A. Adamatzky, O. Holland, Voronoi-like nondeterministic partition of a lattice by collectives of finite automata Mathematical and Computer Modelling. ,vol. 28, pp. 73- 93 ,(1998) , 10.1016/S0895-7177(98)00156-3