213 search results - page 11 / 43 » A comparison of search heuristics for empirical code optimiz... |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The basic decision-theoretic troubleshooting task is described in this paper. Dependency sets are defined for a better understanding of dependent actions. It is shown th...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
73
Voted
CP
1997
Springer
15 years 1 months ago
1997
Springer
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...