1376 search results - page 4 / 276 » Searching Trees: An Essay |
AAAI
2006
14 years 11 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
94
Voted
TCS
2008
14 years 9 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
GPEM
2000
14 years 9 months ago
2000
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
AAAI
1996
14 years 10 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...