Sciweavers

356 search results - page 29 / 72
» On the Global Solution of Linear Programs with Linear Comple...
Sort
View
CP
2005
Springer
14 years 2 months ago
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
Carsten Sinz
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 8 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
CPAIOR
2005
Springer
14 years 2 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
JBCB
2010
123views more  JBCB 2010»
13 years 7 months ago
Characterizing the Space of interatomic Distance Distribution Functions Consistent with Solution Scattering Data
: Scattering of neutrons and x-rays from molecules in solution offers alternative approaches to the studying of a wide range of macromolecular structures in their solution state w...
Paritosh A. Kavathekar, Bruce A. Craig, Alan M. Fr...
31
Voted
APLAS
2011
ACM
12 years 8 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...