902 search results - page 23 / 181 » R* Search |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
The success of decoder-based evolutionary algorithms (EAs) strongly depends on the achieved locality of operators and decoders. Most approaches to investigate locality properties ...
CCCG
2010
13 years 8 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
IJCAI
2003
13 years 8 months ago
2003
Evolutionary computation is a useful technique for learning behaviors in multiagent systems. Among the several types of evolutionary computation, one natural and popular method is...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...