544 search results - page 36 / 109 » Improving Local Search for Fuzzy Scheduling Problems |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
PPL
2010
13 years 2 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
CONSTRAINTS
2007
13 years 8 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
EAAI
2006
13 years 8 months ago
2006
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...