383 search results - page 25 / 77 » A new infeasible interior-point algorithm for linear program... |
130
click to vote
FMCAD
2009
Springer
15 years 10 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
139
Voted
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
157
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
125
Voted
FM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
130
click to vote
ANOR
2008
15 years 4 months ago
2008
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...