Sciweavers

589 search results - page 48 / 118
» Local Search Algorithms for SAT: An Empirical Evaluation
Sort
View
ATAL
2009
Springer
15 years 6 months ago
Adversarial search with procedural knowledge heuristic
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
Viliam Lisý, Branislav Bosanský, Mic...
JAIR
2006
111views more  JAIR 2006»
14 years 11 months ago
Learning in Real-Time Search: A Unifying Framework
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
Vadim Bulitko, Greg Lee
CLOUDCOM
2010
Springer
14 years 9 months ago
Evaluation of MapReduce for Gridding LIDAR Data
-- The MapReduce programming model, introduced by Google, has become popular over the past few years as a mechanism for processing large amounts of data, using sharednothing parall...
Sriram Krishnan, Chaitanya K. Baru, Christopher J....
TSMC
2011
258views more  TSMC 2011»
14 years 6 months ago
Cross-Entropy Optimization of Control Policies With Adaptive Basis Functions
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
ML
2000
ACM
150views Machine Learning» more  ML 2000»
14 years 11 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew