1376 search results - page 161 / 276 » Searching Trees: An Essay |
168
click to vote
IFL
1997
Springer
15 years 10 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
203
click to vote
HUMO
2007
Springer
15 years 10 months ago
2007
Springer
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
164
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
182
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
160
click to vote
AAAI
2010
15 years 7 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...