Sciweavers

1016 search results - page 10 / 204
» Optimized algorithms for multi-agent routing
Sort
View
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 8 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
MOBIHOC
2003
ACM
14 years 7 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
ATAL
2009
Springer
14 years 2 months ago
Stigmergic landmark foraging
In this paper, we describe a nature-inspired optimization algorithm based on bee foraging behavior. This algorithm combines the high performance of bee path-integration navigation...
Nyree Lemmens, Karl Tuyls
GECCO
2006
Springer
291views Optimization» more  GECCO 2006»
13 years 11 months ago
Modular thinking: evolving modular neural networks for visual guidance of agents
This paper investigates whether replacing non-modular artificial neural network brains of visual agents with modular brains improves their ability to solve difficult tasks, specif...
Ehud Schlessinger, Peter J. Bentley, R. Beau Lotto
IIWAS
2008
13 years 9 months ago
Double-agent architecture for collaborative supply chain formation
Supply chains have evolved to web-applications that tap on the power of internet to expand their networks online. Recently some research attention is focused on make-to-order supp...
Yang Hang, Simon Fong