2584 search results - page 89 / 517 » On the Forward Checking Algorithm |
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem prov...
ATVA
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be b...
JDA
2006
13 years 8 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...