Dynamic SAT with Decision Change Costs

We address a dynamic decision problem in which decision makers must pay some costs when they change their decisions along the way. We formalize this problem as Dynamic SAT (DynSAT) with decision change costs, whose goal is to find a sequence of models that minimize the aggregation of the costs for c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Transactions of the Japanese Society for Artificial Intelligence 2011-11, Vol.26 (6), p.682
Hauptverfasser:	Hatano, Daisuke, Hirayama, Katsutoshi
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!