3136 search results - page 189 / 628 » Genetic programming theory |
137
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
185
click to vote
AI
2011
Springer
14 years 11 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
152
click to vote
KGC
1997
Springer
15 years 8 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
124
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
171
click to vote
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...