Sciweavers

858 search results - page 88 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
RECOMB
2004
Springer
14 years 8 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
14 years 2 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
CSCLP
2005
Springer
14 years 1 months ago
On Generators of Random Quasigroup Problems
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
Roman Barták
CSCLP
2004
Springer
14 years 1 months ago
Dynamic Distributed BackJumping
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
CP
2006
Springer
13 years 11 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière