Sciweavers

942 search results - page 124 / 189
» Distance Constraint Satisfaction Problems
Sort
View
IS
2008
15 years 3 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
143
Voted
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
15 years 9 months ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
Andrew Lim, Xingwen Zhang
SMA
2005
ACM
151views Solid Modeling» more  SMA 2005»
15 years 9 months ago
A constructive approach to calculate parameter ranges for systems of geometric constraints
Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such...
Hilderick A. van der Meiden, Willem F. Bronsvoort
131
Voted
SMA
2003
ACM
15 years 8 months ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 3 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...