Sciweavers

163 search results - page 28 / 33
» Solving Simple Stochastic Games
Sort
View
NN
1998
Springer
15 years 3 months ago
A tennis serve and upswing learning robot based on bi-directional theory
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
Hiroyuki Miyamoto, Mitsuo Kawato
FOGA
1998
15 years 5 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal
LICS
2008
IEEE
15 years 10 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
CEC
2007
IEEE
15 years 10 months ago
Clonal particle swarm optimization and its applications
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...
Y. Tan, Z. M. Xiao
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 10 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld