882 search results - page 47 / 177 » Local Search for Very Large SAT Problems |
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
DAC
1998
ACM
16 years 24 days ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
186
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
We study the problem of maintaining large replicated collections of files or documents in a distributed environment with limited bandwidth. This problem arises in a number of impo...
DCG
2010
14 years 12 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...