 | | |
| |
| | Takehide SohLast updated: 09/12/31 14:02 Papers A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima Jouranal of Algorithms in Cognition, Informatics and Logic to appear 2009 [Refereed] A Competitive and Cooperative Approach to Propositional Satisfiability Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara and Naoyuki Tamura Discrete Applied Mathematics 154(16) 2291-2306 2006 [Refereed] Misc A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima The 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion Dec 2008 Lemma Reusing for SAT based Planning and Scheduling Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, and Koji Iwanuma In the proceedings of the International Conference on Automated Planning and Scheduling 2006 (ICAPS 2006) 103-112 2006 Experimental Results for Solving Job-shop Scheduling Problems with Multiple SAT Solvers Takehide Soh, Katsumi Inoue, Mutsunori Banbara, and Naoyuki Tamura In the Proceedings of the 1st International Workshop on Distributed and Speculative Constraint Processing 25-38 Oct 2005 |
|
|
|
| |
Following