668 search results - page 60 / 134 » Algorithmics and Applications of Tree and Graph Searching |
105
Voted
AAAI
2010
15 years 4 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...
246
Voted
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
124
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
118
Voted
ESA
1999
Springer
15 years 6 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
113
click to vote
AIPS
2008
15 years 4 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...