466 search results - page 40 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
161
click to vote
ICANN
2010
Springer
15 years 7 months ago
2010
Springer
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...
234
click to vote
VLDB
2008
ACM
16 years 6 months ago
2008
ACM
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
153
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
256
click to vote
IR
2008
15 years 6 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
147
click to vote
JAR
2000
15 years 5 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...