Sciweavers

80 search results - page 1 / 16
» Using Arc Weights to Improve Iterative Repair
Sort
View
AAAI
1998
13 years 6 months ago
Using Arc Weights to Improve Iterative Repair
One of the surprising findings from the study of CNF satisfiability in the 1990's has been the success of iterative repair techniques, and in particular of weighted iterative...
John Thornton, Abdul Sattar
AIPS
2000
13 years 6 months ago
Using Iterative Repair to Improve the Responsiveness of Planning and Scheduling
The majority of planning and scheduling research has focused on batch-oriented models of planning. This paper discusses the use of iterative repair techniques to support a continu...
Steve A. Chien, Russell Knight, Andre Stechert, Ro...
AAAI
1996
13 years 6 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
AAAI
2010
13 years 6 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
ESANN
2003
13 years 6 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer