Sciweavers

711 search results - page 140 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
SIGSOFT
2007
ACM
14 years 7 months ago
Detection and resolution of atomicity violation in service composition
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...
Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 11 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
AAAI
1996
13 years 8 months ago
Lazy Arc Consistency
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
Thomas Schiex, Jean-Charles Régin, Christin...
DSVIS
2003
Springer
14 years 10 days ago
Calligraphic Interfaces: Mixed Metaphors for Design
CAD systems have yet to become usable at the early stages of product ideation, where precise shape definitions and sometimes even design intentions are not fully developed. To over...
João Paulo Pereira, Joaquim A. Jorge, Vasco...