Sciweavers

CONSTRAINTS
2007
65views more  CONSTRAINTS 2007»
13 years 11 months ago
Local Search-based Hybrid Algorithms for Finding Golomb Rulers
Carlos Cotta, Iván Dotú, Antonio J. ...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 11 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 11 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 11 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
CONSTRAINTS
2007
93views more  CONSTRAINTS 2007»
13 years 11 months ago
Arc-B-consistency of the Inter-distance Constraint
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
Konstantin Artiouchine, Philippe Baptiste
CONSTRAINTS
2007
70views more  CONSTRAINTS 2007»
13 years 11 months ago
A CSP Search Algorithm with Responsibility Sets and Kernels
Igor Razgon, Amnon Meisels