Dynamic Constraint Weighting for Over-Constrained Problems
暂无分享,去创建一个
[1] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[2] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[3] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[4] Byungki Cha,et al. Adding New Clauses for Faster Local Search , 1996, AAAI/IAAI, Vol. 1.
[5] Jeremy Frank. Learning Short-Term Weights for GSAT , 1997, IJCAI.
[6] Abdul Sattar,et al. Using Arc Weights to Improve Iterative Repair , 1998, AAAI/IAAI.
[7] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[8] Abdul Sattar,et al. Applied Partial Constraint Satisfaction Using Weighted Iterative Repair , 1997, Australian Joint Conference on Artificial Intelligence.
[9] Byungki Cha,et al. Local Search Algorithms for Partial MAXSAT , 1997, AAAI/IAAI.
[10] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[11] Eugene C. Freuder,et al. Heuristic Methods for Over-Constrained Constraint Satisfaction Problems , 1995, Over-Constrained Systems.