1171 search results - page 168 / 235 » Variable neighborhood search |
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
IPPS
2003
IEEE
14 years 3 months ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
CICLING
2003
Springer
14 years 3 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...