3510 search results - page 2 / 702 » Searching with numbers |
AAAI
2010
13 years 8 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...
CG
2006
Springer
13 years 10 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
IC
2009
13 years 4 months ago
2009
- In this paper, we describe the usage of number of web pages found by search engines for business analysis. To realize this approach we created the GoogMeter application (www.goog...
AAAI
2010
13 years 8 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
CG
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...