242 search results - page 30 / 49 » Exploration of a Two Sided Rendezvous Search Problem Using G... |
AAAI
2006
13 years 10 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
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...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...