1639 search results - page 157 / 328 » Anytime Heuristic Search |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
BMCBI
2010
13 years 10 months ago
2010
Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioin...
ALGORITHMICA
2000
13 years 10 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
PODS
2010
ACM
14 years 3 months ago
2010
ACM
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
VLDB
1999
ACM
14 years 2 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...