3221 search results - page 440 / 645 » Termination of Linear Programs |
169
click to vote
SAS
2005
Springer
15 years 12 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
166
click to vote
SAT
2005
Springer
15 years 12 months ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
159
click to vote
ASPDAC
2004
ACM
15 years 12 months ago
2004
ACM
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
137
click to vote
FPL
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...
148
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...