Richard J. Wallace, Eugene C. Freuder  Home/Search
Context
Related
| 4c.ucc.ie/web/uploa...rjwecfcp99.ps.gz 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: 4c.ucc.ie/web/d...2010&firstname= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In recent years the constraint satisfaction paradigm has been extended to the case in which a problem can undergo changes that may invalidate the current solution. If such changes are recurrent, it may be possible to find solutions that are more likely to remain valid after such changes (stable solutions). In earlier work we have found that, (i) hill climbing procedures such as min-conflicts are peculiarly suitable for dealing with dynamic CSPs, in part because, (ii) these procedures can ... (Update)
Similar documents (at the sentence level):
9.4%: Stable Solutions for Dynamic Constraint Satisfaction Problems - Wallace, Freuder (1998) (Correct)
7.4%: Representing and Coping with Recurrent Change in Dynamic.. - Wallace, Freuder (1999) (Correct)
Active bibliography (related documents): More All
0.5: An Instance of Adaptive Constraint Propagation - Sakkout, Wallace, Richards (1996) (Correct)
0.1: Dynamic scheduling: State of the art report - Kocjan (2002) (Correct)
0.0: Failure-Driven Refinement Search with Local Repair-Based.. - Hsieh, Archibald, Smith (1997) (Correct)
Similar documents based on text: More All
0.5: Anytime Algorithms for Constraint Satisfaction and SAT problems - Wallace, Freuder (1995) (Correct)
0.4: Dispatchable Execution of Schedules Involving Consumable.. - Wallace, Freuder (2000) (Correct)
0.4: Heuristic Methods for Over-Constrained Constraint.. - Wallace, Freuder (1995) (Correct)
BibTeX entry: (Update)
@misc{ wallace-local,
author = "Richard J. Wallace and Eugene C. Freuder",
title = "Local Failure vs. Bayesian Methods for Finding Stable Solutions to Dynamic
Constraint Satisfaction Problems",
url = "citeseer.ist.psu.edu/558239.html" }
Citations (may not include all citations):210 Minimizing conflicts: a heuristic repair method for constrai.. - Minton, Johnston et al. - 1992
91 Belief maintenance in dynamic constraint networks (context) - Dechter, Dechter - 1988 DBLP
74 An empirical study of greedy local search for satisfiability.. - Selman, Kautz - 1993
48 Nogood recording for static and dynamic constraint satisfact.. - Schiex, Verfaillie - 1993 DBLP
19 Analysis of heuristic methods for partial constraint satisfa.. - Wallace - 1996 DBLP
17 Stable solutions for dynamic constraint satisfaction problem.. - Wallace, Freuder - 1997 ACM DBLP
15 Arc-consistency in dynamic constraint satisfaction problems (context) - Bessiere - 1991 DBLP
2 A decision-theoretic scheduler for space telescope applicati.. (context) - Hansson, Mayer - 1994
Documents on the same site (http://4c.ucc.ie/web/displaypubs.jsp?author=&fromyear=1900&toyear=2010&firstname=): More
Balanced Incomplete Block Design as Satisfiability - Prestwich (2001) (Correct)
Texture-Based Heuristics for Scheduling Revisited - Beck, Davenport, Sitarski, Fox (1997) (Correct)
A Local Search Algorithm for Balanced Incomplete Block Designs - Prestwich (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