Sciweavers

501 search results - page 11 / 101
» Scheduling Abstractions for Local Search
Sort
View
CP
2006
Springer
13 years 11 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
EVOW
2007
Springer
14 years 1 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...
PVM
2004
Springer
14 years 21 days ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
TASE
2008
IEEE
13 years 7 months ago
Group Elevator Scheduling With Advance Information for Normal and Emergency Modes
Group elevator scheduling has long been recognized as an important problem for building transportation efficiency, since unsatisfactory elevator service is one of the major complai...
Peter B. Luh, Bo Xiong, Shi-Chung Chang
VMCAI
2004
Springer
14 years 21 days ago
History-Dependent Scheduling for Cryptographic Processes
Abstract. This paper presents history-dependent scheduling, a new technique for reducing the search space in the verification of cryptographic protocols. This technique allows the...
Vincent Vanackère