Sciweavers

703 search results - page 29 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
AAAI
2012
11 years 10 months ago
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Christer Bäckström, Yue Chen, Peter Jons...
IPPS
1997
IEEE
13 years 12 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
VLDB
1992
ACM
111views Database» more  VLDB 1992»
13 years 11 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
ICCBR
2005
Springer
14 years 1 months ago
Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
Sushil J. Louis, Chris Miles
UAI
2003
13 years 9 months ago
Symbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein