Efficient local search with conflict minimization: a case study of the n-queens problem

Backtracking search is frequently applied to solve a constraint-based search problem, but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search with conflict minimization. We have applied this general search framework to study a be...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on knowledge and data engineering 1994-10, Vol.6 (5), p.661-668
Hauptverfasser:	Sosic, R., Jun Gu
Format:	Artikel
Sprache:	eng
Schlagworte:	Application software Computer aided software engineering Computer science Concurrent computing Councils Optical computing Scholarships Search problems Very large scale integration Workstations
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!