05月23日(Tue) 15:50〜17:30 M会場(ウインクあいち-10F 1005会議室)
| 演題番号 | 1M2-OS-02b-2 |
|---|---|
| 題目 | Boost SAT solver with hybrid branching heuristic |
| 著者 | ムン ソンス(東京大学) 稲葉 真理(東京大学 情報理工学系研究科 創造情報学専攻) |
| 時間 | 05月23日(Tue) 16:10〜16:30 |
| 概要 | Most state-of-the-art SAT solvers use VSIDS as their branching heuristic because of its robustness. However, in general, a branching heuristic can not cover all problems. It is axiomatic that mixture of branching heuristic with adequate configuration performs better than single branching heuristic. In this paper, we propose hybrid branching heuristic and show some preliminary experimental results using benchmarks from SAT competitions to evaluate its efficiency. |
| 論文 | PDFファイル |