805 search results - page 50 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
123
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
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...
145
click to vote
EUROGP
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
111
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...
147
click to vote
IPCO
2008
15 years 5 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
242
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
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...