2436 search results - page 38 / 488 » Evaluating Adaptive Problem Selection |
129
click to vote
AISB
1994
Springer
15 years 6 months ago
1994
Springer
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
146
click to vote
HEURISTICS
1998
15 years 1 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
103
click to vote
ESAW
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. If we are to enable agents to handle increasingly greater levels of complexity, it is necessary to equip them with mechanisms that support greater degrees of autonomy. Th...
116
Voted
AAAI
2007
15 years 4 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
120
click to vote
ICMCS
2007
IEEE
15 years 8 months ago
2007
IEEE
So far, lots of prediction structures have been proposed to exploit the temporal and inter-view redundancy of multi-view video. However, none of them can adapt themselves to diffe...