Sciweavers

721 search results - page 81 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
CP
2004
Springer
15 years 3 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
APPROX
2010
Springer
297views Algorithms» more  APPROX 2010»
14 years 11 months ago
Approximating Linear Threshold Predicates
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
Mahdi Cheraghchi, Johan Håstad, Marcus Isaks...
ECCC
2010
111views more  ECCC 2010»
14 years 9 months ago
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
Venkatesan Guruswami, Yuan Zhou
EOR
2007
364views more  EOR 2007»
14 years 9 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
IS
2007
14 years 9 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki