===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Masafumi Yamashita Vice Chair: Tatsuya Akutsu
Secretary: Keisuke Tanaka, Kunihiko Sadakane
DATE:
Fri, Jun 24, 2005 10:30 - 16:55
PLACE:
Toyama University(http://www.eng.toyama-u.ac.jp/en/access.html. Prof. Sadaki Hirose. 076-445-6754)
TOPICS:
----------------------------------------
Fri, Jun 24 AM (10:30 - 16:55)
----------------------------------------
(1) 10:30 - 11:00
Objective Function Adjustment Algorithm for Combinatorial Optimization Problems
Hiroki Tamura, Zheng Tang, Masahiro Ishii (Toyama Univ.)
(2) 11:00 - 11:25
Similar Pattern Generation of Complex Snow Crystals Grown under Changing Environment
Kazuya Yamashita, Sadaki Hirose (Toyama Univ.), Yasuhiro Ogoshi (Fukui Univ.), Haruhiko Kimura (Kanazawa Univ.)
(3) 11:25 - 11:55
A Method to Predict Computational Complexity of Adaptive Mesh Refinement by Fractal Analysis
Yasuhiro Kawasaki, Fumihiko Ino, Kenichi Hagihara (Osaka Univ.)
----- Lunch Break ( 80 min. ) -----
(4) 13:15 - 13:45
Improving competitive ratios of online buffer management for shared-memory switches
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
(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)
----- Break ( 15 min. ) -----
(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)
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:
Thu, Sep 15, 2005: Osaka Univ., Toyonaka Campus [Fri, Jul 22]
Last modified: 2005-04-25 12:07:34
|
Notification: Mail addresses are partially hidden against SPAM.
|