E. Thomas Richards  Home/Search
Context Related
| icparc.ic.ac.uk/pape...tomthesis.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: icparc.ic.ac.uk/thesis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Non-systematic algorithms use local information to guide the search for a solution. Empirical research has highlighted that these algorithms are, in general, well-suited to large-scale problems with many solutions. However, most non-systematic search techniques perform badly for problems with few solutions and most are incomplete, i.e. they cannot prove inconsistency. This thesis presents a new, complete, non-systematic search algorithm that is designed to handle tightly constrained problems... (Update)
Similar documents based on text: More All
0.3: Systematic and Nonsystematic Search - Ginsberg (Correct)
0.3: Comparing Detection Methods For Software Requirements.. - Porter, Votta, Jr.. (1995) (Correct)
0.3: Experimenting with New Systematic and Nonsystematic Search.. - Jonsson, Ginsberg (1993) (Correct)
BibTeX entry: (Update)
E. T. Richards and B. Richards. Non-systematic search and no-good learning. Journal of Automated Reasoning, 24(4):483-533, 2000. http://citeseer.ist.psu.edu/richards98nonsystematic.html More
@article{ richards00nonsystematic,
author = "E. Thomas Richards and Barry Richards",
title = "Nonsystematic Search and No-Good Learning",
journal = "Journal of Automated Reasoning",
volume = "24",
number = "4",
pages = "483-533",
year = "2000",
url = "citeseer.ist.psu.edu/richards98nonsystematic.html" }
Citations (may not include all citations):473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
416 A new method for solving hard satisfiability problems - Selman, Levesque et al. - 1992
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992
265 Increasing tree search efficiency for constraint satisfactio.. (context) - Haralick, Elliott - 1980
214 Constraint Satisfaction in Logic Programming (context) - van Hentenryck - 1989
211 Hybrid algorithms for the constraint satisfaction problem (context) - Prosser - 1993
211 Enhancement schemes for constraint processing: backjumping (context) - Dechter - 1990
190 Using CSP look-back techniques to solve real-world SAT insta.. - Bayardo, Schrag - 1997
146 Domain independent extensions to GSAT: Solving large structu.. - Selman, Kautz - 1993
127 Constraint Satisfaction Algorithms (context) - Nadel - 1989
97 Experimental results on the crossover point in random 3SAT - Crawford, Auton - 1996
93 Journal of Artificial Intelligence Research (context) - Ginsberg, Backtracking - 1993
87 A Theoretical Evaluation of Selected Backtracking Algorithms - Kondrak, van Beek - 1995
[Article contains additional citations not shown here]
Documents on the same site (http://www.icparc.ic.ac.uk/thesis.html):
Generation and Comparison of Constraint-Based Heuristics Using.. - Rodosek (1997) (Correct)
Directed Annealing Search In Constraint Satisfaction and Optimisation - Li (1997) (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