Sciweavers

622 search results - page 116 / 125
» Solving the Robots Gathering Problem
Sort
View
PEWASUN
2004
ACM
14 years 2 months ago
A routing protocol for power constrained networks with asymmetric links
In many instances, an ad hoc network consists of nodes with different hardware and software capabilities as well as power limitations. This is the case of ad hoc grids where devi...
Guoqiang Wang, Yongchang Ji, Dan C. Marinescu, Dam...
ECP
1997
Springer
92views Robotics» more  ECP 1997»
14 years 1 months ago
Understanding and Extending Graphplan
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
Subbarao Kambhampati, Eric Parker, Eric Lambrecht
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 19 days ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
14 years 19 days ago
A computational theory of adaptive behavior based on an evolutionary reinforcement mechanism
Two mathematical and two computational theories from the field of human and animal learning are combined to produce a more general theory of adaptive behavior. The cornerstone of ...
J. J. McDowell, Paul L. Soto, Jesse Dallery, Saule...
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
14 years 19 days ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone