Sciweavers

1996 search results - page 28 / 400
» A decision procedure for linear
Sort
View
PG
2003
IEEE
15 years 3 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
93
Voted
CADE
2008
Springer
15 years 10 months ago
Linear Quantifier Elimination
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
Tobias Nipkow
MIE
2008
95views Healthcare» more  MIE 2008»
14 years 11 months ago
Diagnostic Games: from Adequate Formalization of Clinical Experience to Structure Discovery
A method of obtaining well-founded and reproducible results in clinical decision making is presented. It is based on "diagnostic games", a procedure of elicitation and fo...
Michael A. Shifrin, Eva I. Kasparova
ICASSP
2011
IEEE
14 years 1 months ago
Smart grid monitoring for intrusion and fault detection with new locally optimum testing procedures
The vulnerability of smart grid systems is a growing concern. Signal detection theory is employed here to detect a change in the system. We employ a discrete-time linear state spa...
Qian He, Rick S. Blum
SAT
2004
Springer
97views Hardware» more  SAT 2004»
15 years 3 months ago
Incremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
Marco Benedetti, Sara Bernardini