Sciweavers

1800 search results - page 11 / 360
» Learning Restart Strategies
Sort
View
GECCO
2009
Springer
170views Optimization» more  GECCO 2009»
14 years 4 days ago
Benchmarking a BI-population CMA-ES on the BBOB-2009 noisy testbed
We benchmark the BI-population CMA-ES on the BBOB2009 noisy functions testbed. BI-population refers to a multistart strategy with equal budgets for two interlaced restart strategi...
Nikolaus Hansen
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
14 years 22 days ago
Dynamic Strategies in a Real-Time Strategy Game
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
William Joseph Falke II, Peter Ross
AIIDE
2006
13 years 9 months ago
Designing a Reinforcement Learning-based Adaptive AI for Large-Scale Strategy Games
This paper investigates the challenges posed by the application of reinforcement learning to large-scale strategy games. In this context, we present steps and techniques which syn...
Charles A. G. Madeira, Vincent Corruble, Geber Ram...
CEC
2009
IEEE
14 years 2 months ago
Multi-start JADE with knowledge transfer for numerical optimization
— JADE is a recent variant of Differential Evolution (DE) for numerical optimization, which has been reported to obtain some promising results in experimental study. However, we ...
Fei Peng, Ke Tang, Guoliang Chen, Xin Yao
ICTAI
2007
IEEE
14 years 1 months ago
Multi-agent Reinforcement Learning Using Strategies and Voting
Multiagent learning attracts much attention in the past few years as it poses very challenging problems. Reinforcement Learning is an appealing solution to the problems that arise...
Ioannis Partalas, Ioannis Feneris, Ioannis P. Vlah...