Sciweavers

1257 search results - page 181 / 252
» Simplifying spline models
Sort
View
ARTS
1997
Springer
15 years 1 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
ICTAI
1997
IEEE
15 years 1 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
ICALP
2010
Springer
14 years 11 months ago
Example-Guided Abstraction Simplification
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
Roberto Giacobazzi, Francesco Ranzato
ECAI
2008
Springer
14 years 11 months ago
The Impact of Constraint Programming
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
Pascal Van Hentenryck
MSO
2003
14 years 11 months ago
Control System Design of the CERN/CMS Tracker Thermal Screen
The Tracker is one of the CMS (Compact Muon Solenoid experiment) detectors to be installed at the LHC (Large Hadron Collider) accelerator, scheduled to start data taking in 2007. ...
Enzo Carrone, Andromachi Tsirou