1816 search results - page 28 / 364 » A New Approach for Solving the Maximum Clique Problem |
103
click to vote
SAT
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
118
click to vote
EPS
1998
Springer
15 years 4 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
KBSE
2010
IEEE
14 years 10 months ago
2010
IEEE
The installation of software packages depends on the correct resolution of dependencies and conflicts between packages. This problem is NP-complete and, as expected, is a hard ta...
104
click to vote
AAAI
1994
15 years 1 months ago
1994
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...