Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in performance. Our study reveals some intriguing properties of such distributions: They are often characterized by very long tai...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of automated reasoning 2000-02, Vol.24 (1-2), p.67-100
Hauptverfasser:	Gomes, Carla P, Selman, Bart, Crato, Nuno, Kautz, Henry
Format:	Artikel
Sprache:	eng
Schlagworte:	Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!