2266 search results - page 215 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
153
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
146
click to vote
ERCIMDL
2000
Springer
15 years 6 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
128
click to vote
AAAI
2006
15 years 4 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
118
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
140
click to vote
WG
2009
Springer
15 years 9 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...