値変更コスト付き動的SATの定式化とその解法
スポンサーリンク
概要
- 論文の詳細を見る
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 changing variables. We provide two solutions to solve a specific case of this problem. The first uses a Weighted Partial MaxSAT solver after we encode the entire problem as a Weighted Partial MaxSAT problem. The second solution, which we believe is novel, uses the Lagrangian decomposition technique that divides the entire problem into sub-problems, each of which can be separately solved by an exact Weighted Partial MaxSAT solver, and produces both lower and upper bounds on the optimal in an anytime manner. To compare the performance of these solvers, we experimented on the random problem and the target tracking problem. The experimental results show that a solver based on Lagrangian decomposition performs better for the random problem and competitively for the target tracking problem.
論文 | ランダム
- 千葉永興寺釋迦如來立像と胎内納入文書
- 中世における仏像の仏性--伝香寺蔵裸形地蔵菩薩像胎内納入物の検討を中心に
- 胎内納入物にみる中世仏教振興--伝香寺裸形地蔵菩薩像を中心に (平成13年度立正大学史学会大会・総会報告)
- 密教の受容した五臓説--胎内納入品と覚鑁『五輪九字明秘密釈』を中心として
- 仏像胎内納入物について