78 search results - page 4 / 16 » A comparison of empirical and model-driven optimization |
GECCO
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We discuss the problem of model selection in Genetic Programming using the framework provided by Statistical Learning Theory, i.e. Vapnik-Chervonenkis theory (VC). We pre...
IWANN
2005
Springer
14 years 4 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
GECCO
1999
Springer
14 years 3 months ago
1999
Springer
This paper examines some of the reporting and research practices concerning empirical work in genetic programming. We describe several common loopholes and offer three case studie...
CP
1997
Springer
14 years 3 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...
CASCON
1996
14 years 5 days ago
1996
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...