Sciweavers

501 search results - page 1 / 101
» Scheduling Abstractions for Local Search
Sort
View
70
Voted
CPAIOR
2004
Springer
15 years 3 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
92
Voted
IJCNN
2006
IEEE
15 years 4 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang
72
Voted
AICOM
2007
61views more  AICOM 2007»
14 years 10 months ago
Scheduling social tournaments locally
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
Iván Dotú, Pascal Van Hentenryck
74
Voted
AI
2003
Springer
15 years 3 months ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
Dave A. D. Tompkins, Holger H. Hoos
80
Voted
CPAIOR
2005
Springer
15 years 3 months ago
Nondeterministic Control for Hybrid Search
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
Pascal Van Hentenryck, Laurent Michel