707 search results - page 45 / 142 » A Practical Method for Quickly Evaluating Program Optimizati... |
SAS
2010
Springer
13 years 6 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
CPAIOR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...