Sciweavers

850 search results - page 71 / 170
» Constraint propagation on quadratic constraints
Sort
View
FLAIRS
2008
13 years 10 months ago
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
Federico Heras, Vasco M. Manquinho, João Ma...
POPL
2001
ACM
14 years 9 months ago
Colored local type inference
We present a type system for a language based on F, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination o...
Martin Odersky, Christoph Zenger, Matthias Zenger
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 4 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
WLP
2005
Springer
14 years 2 months ago
Meta-S - Combining Solver Cooperation and Programming Languages
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
Stephan Frank, Petra Hofstedt, Dirk Reckmann
AUTOMATICA
2004
112views more  AUTOMATICA 2004»
13 years 8 months ago
Ellipsoidal parameter or state estimation under model uncertainty
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...
Boris T. Polyak, Sergey A. Nazin, Cécile Du...