1300 search results - page 89 / 260 » Constraint satisfaction problems and global cardinality cons... |
276
click to vote
CP
2009
Springer
16 years 7 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...
155
click to vote
GCB
1997
Springer
15 years 10 months ago
1997
Springer
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
160
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
154
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
172
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...