450 search results - page 33 / 90 » Estimating Search Tree Size |
AAAI
1998
13 years 10 months ago
1998
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
DOCENG
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resu...
EACL
2003
ACL Anthology
13 years 10 months ago
2003
ACL Anthology
We present a neural-network-based statistical parser, trained and tested on the Penn Treebank. The neural network is used to estimate the parameters of a generative model of left-...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
The enormity and rapid growth of the web-graph forces quantities such as its pagerank to be computed under missing information consisting of outlinks of pages that have not yet be...