438 search results - page 75 / 88 » Optimal Solvers for PDE-Constrained Optimization |
VLSID
2007
IEEE
15 years 11 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
CADE
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
CADE
2003
Springer
15 years 11 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...