6月24日(金) 午前 10:30 - 16:55 |
(1) |
10:30-11:00 |
目的関数調整法を用いた組合せ最適化問題の解法 |
○田村宏樹・唐 政・石井雅博(富山大) |
(2) |
11:00-11:25 |
環境の変化によって生じる複雑な形をした雪の結晶の類似パターン生成 |
○山下和也・広瀬貞樹(富山大)・小越康宏(福井大)・木村春彦(金沢大) |
(3) |
11:25-11:55 |
フラクタル解析による適合格子細分化法の計算量予測 |
○川崎康博・伊野文彦・萩原兼一(阪大) |
|
11:55-13:15 |
昼食 ( 80分 ) |
(4) |
13:15-13:45 |
共有メモリ型スイッチにおけるオンラインバッファ管理アルゴリズムの競合比の改良 |
○小林浩二・宮崎修一・岡部寿男(京大) |
(5) |
13:45-14:15 |
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages |
○Satoshi Okawa(The Univ. of Aizu)・Sadaki Hirose(Toyama Univ.) |
(6) |
14:15-14:45 |
Online and Dynamic Detection of Squares in Strings |
○Jesper Jansson(Kyushu Univ./The Univ. of Hong Kong/Kyoto Univ.)・Zeshan Peng(The Univ. of Hong Kong) |
|
14:45-15:00 |
休憩 ( 15分 ) |
(7) |
15:00-15:30 |
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are Of Small Size |
○Seinosuke Toda(Nihon Univ.) |
(8) |
15:30-16:00 |
Approximation Algorithms for Source Location Problems with Flow Requirements |
○Mariko Sakashita(Kyoto Univ.)・Kazuhisa Makino(Osaka Univ.)・Satoru Fujishige(Kyoto Univ.) |
(9) |
16:00-16:30 |
A Deterministic Algorithm for Finding All Minimum k-Way Cuts |
○Yoko Kamidoi・Noriyoshi Yoshida(Hiroshima City Univ.)・Hiroshi Nagamochi(Kyoto Univ.) |
(10) |
16:30-16:55 |
On Computational Power of Insertion-Deletion Systems without Using Contexts |
○Sadaki Hirose(Toyama Univ.)・Satoshi Okawa(The Univ. of Aizu) |