466 search results - page 23 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
153
click to vote
PEPM
2007
ACM
16 years 2 days ago
2007
ACM
Poly-Controlled Partial Evaluation (PCPE) is a powerful approach to partial evaluation, which has recently been proposed. PCPE takes into account sets of control strategies instea...
164
click to vote
JACM
2007
15 years 5 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
168
click to vote
WEBI
2009
Springer
16 years 16 days ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
195
click to vote
PUK
2003
15 years 7 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
159
click to vote
COLING
2002
15 years 5 months ago
2002
We describe a parser for robust and flexible interpretation of user utterances in a multi-modal system for web search in newspaper databases. Users can speak or type, and they can...