Sciweavers

721 search results - page 78 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
CP
2000
Springer
15 years 2 months ago
A Language for Audiovisual Template Specification and Recognition
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...
Jean Carrive, Pierre Roy, François Pachet, ...
ECSQARU
2007
Springer
15 years 4 months ago
Algebraic Structures for Bipolar Constraint-Based Reasoning
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this ...
Hélène Fargier, Nic Wilson
CP
2009
Springer
15 years 10 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
CP
1997
Springer
15 years 1 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
15 years 3 months ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan