1614 search results - page 153 / 323 » Breadth-First Heuristic Search |
152
click to vote
ALGORITHMICA
2000
15 years 4 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...
116
click to vote
PODS
2010
ACM
15 years 9 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...
188
click to vote
VLDB
1999
ACM
15 years 8 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 ...
138
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
152
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...