Sciweavers

367 search results - page 27 / 74
» Truncated incremental search
Sort
View
CPAIOR
2004
Springer
14 years 28 days ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
AI
2002
Springer
13 years 7 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
ICML
2009
IEEE
14 years 8 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
WWW
2004
ACM
14 years 8 months ago
Best bets: thousands of queries in search of a client
A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to ...
Giuseppe Attardi, Andrea Esuli, Maria Simi
DEXA
2009
Springer
124views Database» more  DEXA 2009»
14 years 2 months ago
VisiNav: Visual Web Data Search and Navigation
Semantic Web technologies facilitate data integration over a large number of sources with decentralised and loose coordination, ideally leading to interlinked datasets which descri...
Andreas Harth