Improving the Performance of Interactive Configuration with Regular String Constraints

A generalization of the problem of interactive configuration has previously been presented in [1]. This generalization utilized decomposition to extend the standard finite domain interactive configuration framework to deal with unbounded string variables and provided features such as prefix auto-com...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hansen, E.R., Tiedemann, P.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Artificial intelligence Binary decision diagrams Boolean functions Constraint optimization Constraint Programming Constraint theory Data structures Decision Support NP-hard problem Polynomials Regular Languages
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!