250 search results - page 26 / 50 » Verifying Tolerant Systems Using Polynomial Approximations |
127
Voted
SIAMSC
2011
14 years 10 months ago
2011
Abstract. In this paper, we propose new adaptive local refinement (ALR) strategies for firstorder system least-squares (FOSLS) finite element in conjunction with algebraic multi...
124
click to vote
VMCAI
2005
Springer
15 years 9 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
211
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
We introduce Pulse, a framework for processing continuous queries over models of continuous-time data, which can compactly and accurately represent many real-world activities and p...
124
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
108
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...