2584 search results - page 72 / 517 » On the Forward Checking Algorithm |
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
IJCAI
2001
13 years 9 months ago
2001
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms....
ACSD
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
ENTCS
2008
13 years 8 months ago
2008
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.