133 search results - page 20 / 27 » Approximation bounds for Black Hole Search problems |
IPL
2010
14 years 10 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
SIGIR
2010
ACM
14 years 12 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
115
click to vote
AIPS
2006
15 years 1 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
100
click to vote
AI
2008
Springer
14 years 11 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
92
Voted
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
It has been shown repeatedly that iterative relevance feedback is a very efficient solution for content-based image retrieval. However, no existing system scales gracefully to hu...