4940 search results - page 255 / 988 » On the Complexity of Universal Programs |
159
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
181
click to vote
ICCBR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
190
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
154
click to vote
IWPC
1996
IEEE
15 years 10 months ago
1996
IEEE
Evaluating the design of a distributed application is di cult but provides useful information for program development and maintenance. In distributed debugging, for example, proce...
159
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...