Richard J. Wallace  Home/Search
Context Related
| unh.edu/pub/csp/Papers...cp96rjw.ps.gz 4c.ucc.ie/web/upload/publ...cp96rjw.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unh.edu/~rjw/rjwpap (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Problems that do not have complete solutions occur in many areas of application of constraint solving. Heuristic repair methods that have been used successfully on complete CSPs can also be used on overconstrained problems. A difficulty in analyzing their performance is the uncertainty about the goodness of solutions returned in relation to the optimal (best possible) solutions. This difficulty can be overcome by testing these procedures on problems that can be solved by complete methods,... (Update)
Context of citations to this paper: More
.... generated solution like done e.g. in GSAT [14] Another very popular approach is the introduction of random moves during the search [13, 6, 18]. Here in this article we will have a closer look on Tabu Search. Tabu Search is one of the most successful metaheuristics in the...
.... algorithms, such as GSAT [35, 1] developed for Boolean Satisfiability and Constraint Satisfaction can be directly applied to Max CSP [41]. Since they are incomplete, SLS algorithms cannot guarantee a solution, but they have been successful in practice on many classes of SAT...
Cited by: More
Dynamic scheduling: State of the art report - Kocjan (2002) (Correct)
Local Failure vs. Bayesian Methods for Finding Stable.. - Wallace, Freuder (Correct)
Random Constraint Satisfaction: Flaws and Structure - Gent, MacIntyre, Prosser.. (1998) (Correct)
Similar documents (at the sentence level):
9.0%: Heuristic Methods for Over-Constrained Constraint.. - Wallace, Freuder (1995) (Correct)
Active bibliography (related documents): More All
0.1: Simple Yet Effective Algorithms for Constraint Satisfaction and.. - Lau (1996) (Correct)
0.1: An Empirical Study of Min-Conflict Hill Climbing and Weak.. - Pothos, Richards (1996) (Correct)
0.1: Anytime Algorithms for Constraint Satisfaction and SAT problems - Wallace, Freuder (1995) (Correct)
Similar documents based on text: More All
0.3: Current Approaches for Solving Over-Constrained Problems - Noureddine (Correct)
0.1: Enhancements of Branch and Bound Methods for the Maximal.. - Wallace (1996) (Correct)
0.1: Analysis And Synthesis Of Overconstrained Mechanisms - Mavroidis, Roth (1994) (Correct)
Related documents from co-citation: More All
7: Partial Constraint Satisfaction - Freuder, Wallace - 1992
6: Minimizing conflicts: a heuristic repair method for constraint satisfaction and .. - Minton, Johnston et al. - 1992
6: Improving repair-based constraint satisfaction methods by value propagation (context) - Yugami, Ohta et al. - 1994
BibTeX entry: (Update)
R. J. Wallace. Analysis of heuristic methods for partial constraint satisfaction problems. In E. C. Freuder, editor, Principles and Practice of Constraint Programming - CP'96, volume 1118 of Lecture Notes in Computer Science, pages 482--496. Springer, Berlin, 1996. http://citeseer.ist.psu.edu/wallace96analysis.html More
@inproceedings{ wallace96analysis,
author = "Richard J. Wallace",
title = "Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems",
booktitle = "Principles and Practice of Constraint Programming",
pages = "482-496",
year = "1996",
url = "citeseer.ist.psu.edu/wallace96analysis.html" }
Citations (may not include all citations):371 Optimization by simulated annealing: An experimental evaluat.. (context) - Johnson, Aragon et al. - 1991
311 Partial constraint satisfaction - Freuder, Wallace - 1992
210 Minimizing conflicts: a heuristic repair method for constrai.. - Minton, Johnston et al. - 1992
135 Solving large-scale constraint satisfaction and scheduling p.. (context) - Minton, Johnston et al. - 1990
129 Valued constraint satisfaction problems: Hard and easy probl.. - Schiex, Fargier et al. - 1995
113 The breakout method for escaping from local minima (context) - Morris - 1993
78 Phase transition and the mushy region in constraint satisfac.. (context) - Smith - 1994
74 An empirical study of greedy local search for satisfiability.. - Selman, Kautz - 1993
43 Tabu search: a tutorial (context) - Glover - 1990
31 Weak-commitment search for solving constraint satisfaction p.. - Yokoo - 1994
22 GSAT and local consistency - Kask, Dechter - 1995
20 Improving repair-based constraint satisfaction methods by va.. (context) - Yugami, Ohta et al. - 1994
19 The enigma of SAT hill-climbing procedures - Gent, Walsh - 1992
10 Directed arc consistency preprocessing as a strategy for max.. - Wallace - 1995
1 Towards an understanding off hill-climbing procedures for sa.. (context) - Gent, Walsh - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.unh.edu/~rjw/rjwpap.html): More
Generalizing Inconsistency Learning for Constraint Satisfaction - Freuder, Wallace (1995) (Correct)
Stable Solutions for Dynamic Constraint Satisfaction Problems - Wallace, Freuder (1998) (Correct)
Enhancements of Branch and Bound Methods for the Maximal.. - Wallace (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC