187 search results - page 17 / 38 » Limits and Possibilities of BDDs in State Space Search |
EVOW
2011
Springer
14 years 29 days ago
2011
Springer
Abstract. The idea of evolving novel rather than fit solutions has recently been offered as a way to automatically discover the kind of complex solutions that exhibit truly intel...
IMCS
2007
14 years 9 months ago
2007
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
FMSD
2006
14 years 9 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
JMLR
2002
14 years 9 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
AIPS
2008
14 years 11 months ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...