Sciweavers

157 search results - page 17 / 32
» Robust Solutions for Constraint Satisfaction and Optimizatio...
Sort
View
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 8 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
INFOCOM
2003
IEEE
14 years 28 days ago
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
Frédéric Giroire, Antonio Nucci, Nin...
CDC
2009
IEEE
101views Control Systems» more  CDC 2009»
14 years 11 days ago
Barrier function nonlinear optimization for optimal Decompression of divers
— This paper is based on a comprehensive dynamic mathematical model (Copernicus) of vascular bubble formation and growth during and after decompression from a dive. The model des...
Le Feng, Christian R. Gutvik, Tor Arne Johansen, D...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 7 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey