Sciweavers

361 search results - page 51 / 73
» Simulating a computational grid with networked animat agents
Sort
View
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 1 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 1 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
ICN
2005
Springer
14 years 1 months ago
Two Energy-Efficient Routing Algorithms for Wireless Sensor Networks
: Power Conservation is one of the most important challenges in wireless sensor networks. In this paper, we present two minimum-energy routing algorithms. Our main goal is to reduc...
Hung Le Xuan, Youngku Lee, Sungyoung Lee
ACMSE
2004
ACM
14 years 1 months ago
A collaborative problem-solving framework for mobile devices
The explosive growth in the number of mobile devices such as Internet-enabled cellular phones, wireless handheld devices, wireless laptops, and tablet PCs has driven the correspon...
Stanislav Kurkovsky, Bhagyavati, Arris Ray
AGENTS
1997
Springer
13 years 11 months ago
Challenger: A Multi-agent System for Distributed Resource Allocation
In this paper we introduce Challenger, a multiagent system that performs completely distributed resource allocation. Challenger consists of agents which individually manage local ...
Anthony Chavez, Alexandros Moukas, Pattie Maes