Sciweavers

1723 search results - page 174 / 345
» Cycling in linear programming problems
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 4 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
VLSID
2001
IEEE
132views VLSI» more  VLSID 2001»
15 years 10 months ago
Accurate Power Macro-modeling Techniques for Complex RTL Circuits
This paper presents novel techniques for the cycle-accurate power macro-modeling of complex RTL components. The proposed techniques are based on the observation that RTL component...
Nachiketh R. Potlapally, Michael S. Hsiao, Anand R...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
15 years 3 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
15 years 3 months ago
Hinged Dissection of Polypolyhedra
This paper presents a general family of 3D hinged dissections for polypolyhedra, i.e., connected 3D solids formed by joining several rigid copies of the same polyhedron along iden...
Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lin...