Sciweavers

187 search results - page 9 / 38
» Limits and Possibilities of BDDs in State Space Search
Sort
View
ACRI
2006
Springer
15 years 3 months ago
Optimal 6-State Algorithms for the Behavior of Several Moving Creatures
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
Mathias Halbach, Rolf Hoffmann, Lars Both
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 1 months ago
Improving coverage analysis and test generation for large designs
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
Jules P. Bergmann, Mark Horowitz
AAAI
2004
14 years 10 months ago
Structured Duplicate Detection in External-Memory Graph Search
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
Rong Zhou, Eric A. Hansen
AIPS
2004
14 years 10 months ago
Conformant Planning via Heuristic Forward Search: A New Approach
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
Ronen I. Brafman, Jörg Hoffmann
CGO
2006
IEEE
15 years 3 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...