Sciweavers

7092 search results - page 301 / 1419
» Parallelizing constraint programs
Sort
View
CL
2000
Springer
15 years 11 months ago
Dominance Constraints with Set Operators
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
Denys Duchier, Joachim Niehren
CP
1997
Springer
15 years 11 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
AAAI
2006
15 years 8 months ago
An Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Jean-François Puget
186
Voted
EUROPAR
2010
Springer
15 years 7 months ago
Exceptions for Algorithmic Skeletons
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
Mario Leyton, Ludovic Henrio, José M. Pique...
CPAIOR
2005
Springer
16 years 8 days ago
Scheduling Social Golfers Locally
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one o...
Iván Dotú, Pascal Van Hentenryck