Sciweavers

59 search results - page 5 / 12
» Memory-Bounded Bidirectional Search
Sort
View
ENTCS
2002
91views more  ENTCS 2002»
14 years 9 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka
AAMAS
1998
Springer
14 years 9 months ago
Real-Time Search for Autonomous Agents and Multiagent Systems
Since real-time search provides an attractive framework for resource-bounded problem solving, this paper extends the framework for autonomous agents and for a multiagent world. To ...
Toru Ishida
JWSR
2006
113views more  JWSR 2006»
14 years 9 months ago
Search Strategies for Automatic Web Service Composition
: We investigate architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web ser...
Nikola Milanovic, Miroslaw Malek
KI
2008
Springer
14 years 9 months ago
Partial Symbolic Pattern Databases for Optimal Sequential Planning
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
Stefan Edelkamp, Peter Kissmann
ENTCS
2006
134views more  ENTCS 2006»
14 years 9 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening