特定领域全体会议.ppt

全体会議 全体会議 特定領域全体会議?A10班　変移する要素間の関係を条件とする組合せ最適化モデル 研究組織： 宮野英次（九州工業大学） 廣瀬英雄（九州工業大学） 朝廣雄一（九州産業大学） 2007/5/14 * 全体会議 目標 最適化モデル 2007/5/14 * 全体会議 オフライン，静的，固定的 オンライン，未知情報 論文?会議録 Y. Asahiro, E. Miyano, and S. Shimoirisa. K-collect tours for moving objects with release time and deadline, Proc World Multi-Conf Systems, Cybernetics and Informatics, 2005. Y. Asahiro. Simple greedy methods for DNA word design. Proc World Multi-Conf Systems, Cybernetics and Informatics, 2005. H. Hirose. Optimal boundary finding method for the bumpy regions. Proc Int. Federation of Operational Research Societies Conference, 2005. Y. Asahiro, E. Miyano, and S. Shimoirisa. Pickup and delivery for moving objects on broken lines, Proc Italian Conference on Theoretical Computer Science (ICTCS), 2005. Y. Asahiro, E. Miyano, H. Ono, and K. Zenmyo. Graph orientation algorithms to minimize the maximum outdegree. Proc Computing: Australasian Theory Symp (CATS), 2006. H. Hirose, T. Yukizane, E. Miyano. The bump hunting method using the genetic algorithm and the extreme-value statistics with application to a messy customer database. Proc Hawaii Int. Conference on Statistics, Mathematics and Related Fields, 2006. 2007/5/14 * 全体会議 論文?会議録 Y. Asahiro, T. Furukawa, K. Ikegami, and E. Miyano. How to pack directed acyclic graphs into small blocks. Proc Int. Conference on Algorithms and Complexity (CIAC), 2006. H. Hirose, T. Yukizane, and E. Miyano. Boundary detection for bumps using the Gini’s index in messy classification problems. Proc Int Conference on Cybernetics and Information Technologies, Systems and Applications, 2006. T. Yukizane, S. Ohi, E. Miyano, and H. Hirose. The bump hunting method using the genetic algorithm with the extreme-value statistics. IEICE Trans on Information and Systems, 2006. Y. Kiyonari, E. Miyano, and S. Miyazaki. Computational complexity issues in university interview timetabling. Proc Int Conference on the Practice and Theory of Automated Timetabling (PATAT), 2006. Y. Asahiro, T. H