Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

, , &
Artificial Intelligence 58 (1-3):161-205 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(92)90007-k

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,793

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem.Norman Sadeh & Mark S. Fox - 1996 - Artificial Intelligence 86 (1):1-41.
動的重み付き最大制約充足問題に基づくナーススケジューリングシステム―暫定制約の導入に基づく解の安定性の実現―.磯村 厚誌 服部 宏充 - 2005 - Transactions of the Japanese Society for Artificial Intelligence 20:25-35.
分布推定アルゴリズムによる Memetic Algorithms を用いた制約充足問題解決.Handa Hisashi - 2004 - Transactions of the Japanese Society for Artificial Intelligence 19:405-412.
Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.
Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,551,777)

6 months
3 (#1,498,119)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.

View all 17 citations / Add more citations

References found in this work

Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
Iterative broadening.Matthew L. Ginsberg & William D. Harvey - 1992 - Artificial Intelligence 55 (2-3):367-383.

Add more references