3591 search results - page 271 / 719 » Typing linear constraints |
283
click to vote
CAD
2011
Springer
15 years 2 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
190
click to vote
SPIN
2007
Springer
16 years 1 months ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
195
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
179
click to vote
FORMATS
2006
Springer
15 years 11 months ago
2006
Springer
Using a variant of Clariso-Cortadella's parametric method for verifying asynchronous circuits, we formally derive a set of linear constraints that ensure the correctness of so...
180
click to vote
WSC
2001
15 years 8 months ago
2001
We review chessboard distributions for modeling partially specified finite-dimensional random vectors. Chessboard distributions can match a given set of marginals, a given covaria...