450 search results - page 24 / 90 » Estimating Search Tree Size |
149
click to vote
AAAI
2010
15 years 7 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
190
click to vote
HUMO
2007
Springer
15 years 9 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...
147
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
180
click to vote
SPIRE
2004
Springer
15 years 11 months ago
2004
Springer
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
137
click to vote
GECCO
2007
Springer
16 years 2 days ago
2007
Springer
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...