3600 search results - page 52 / 720 » The settling-time reducibility ordering |
143
click to vote
SPIN
2007
Springer
15 years 12 months ago
2007
Springer
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
137
Voted
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
A new model-order reduction technique for linear dynamic systems is presented. The idea behind this technique is to transform the dynamic system function from the s-domain into th...
167
Voted
FLAIRS
2007
15 years 8 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
161
Voted
APLAS
2010
ACM
15 years 6 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
162
click to vote
JAR
2002
15 years 5 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...