Sciweavers

1927 search results - page 330 / 386
» UMDAs for dynamic optimization problems
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 6 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
97
Voted
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 6 months ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
131
Voted
UAI
2008
15 years 2 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
99
Voted
ATAL
2010
Springer
15 years 1 months ago
Deception in networks of mobile sensing agents
Recent studies have investigated how a team of mobile sensors can cope with real world constraints, such as uncertainty in the reward functions, dynamically appearing and disappea...
Viliam Lisý, Roie Zivan, Katia P. Sycara, M...
133
Voted
ATAL
2005
Springer
15 years 6 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson