| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2005-06-24
10:30 |
Toyama |
|
Objective Function Adjustment Algorithm for Combinatorial Optimization Problems
Hiroki Tamura, Zheng Tang, Masahiro Ishii (Toyama Univ.) |
In this paper, we proposed an improved algorithm of Guided Local Search (GLS) for Combinatorial Optimization problems, w... [more] |
COMP2005-18
pp.1-4 |
| COMP |
2005-06-24
11:00 |
Toyama |
|
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.) |
There have been already many researches for simulations of snow crystal growth, but almost of them were based on numeric... [more] |
COMP2005-19
pp.5-8 |
| COMP |
2005-06-24
11:25 |
Toyama |
|
A Method to Predict Computational Complexity of Adaptive Mesh Refinement by Fractal Analysis
Yasuhiro Kawasaki, Fumihiko Ino, Kenichi Hagihara (Osaka Univ.) |
This paper presents a method for predicting the computational complexity of adaptive mesh refinement (AMR) method. AMR i... [more] |
COMP2005-20
pp.9-15 |
| COMP |
2005-06-24
13:15 |
Toyama |
|
Improving competitive ratios of online buffer management for shared-memory switches
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
The buffer management problem is a kind of online problems, which
formulates the problem of queueing policies of networ... [more] |
COMP2005-21
pp.17-22 |
| COMP |
2005-06-24
13:45 |
Toyama |
|
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages
Satoshi Okawa (The Univ. of Aizu), Sadaki Hirose (Toyama Univ.) |
Watson-Crick automata were introduced as a new computer model and have
been intensively investigated regarding their c... [more] |
COMP2005-22
pp.23-30 |
| COMP |
2005-06-24
14:15 |
Toyama |
|
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) |
The online squarefree recognition problem is to detect the first occurrence
of a square in a string whose characters ar... [more] |
COMP2005-23
pp.31-36 |
| COMP |
2005-06-24
15:00 |
Toyama |
|
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are Of Small Size
Seinosuke Toda (Nihon Univ.) |
It is known that any chordal graph can be uniquely decomposed into simplicial
components. Based on this fact, it is sho... [more] |
COMP2005-24
pp.37-42 |
| COMP |
2005-06-24
15:30 |
Toyama |
|
Approximation Algorithms for Source Location Problems with Flow Requirements
Mariko Sakashita (Kyoto Univ.), Kazuhisa Makino (Osaka Univ.), Satoru Fujishige (Kyoto Univ.) |
[more] |
COMP2005-25
pp.43-50 |
| COMP |
2005-06-24
16:00 |
Toyama |
|
A Deterministic Algorithm for Finding All Minimum k-Way Cuts
Yoko Kamidoi, Noriyoshi Yoshida (Hiroshima City Univ.), Hiroshi Nagamochi (Kyoto Univ.) |
Let $G=(V,E)$ be an edge-weighted
undirected graph with $n$ vertices and $m$ edges.
We present a deterministic algori... [more] |
COMP2005-26
pp.51-58 |
| COMP |
2005-06-24
16:30 |
Toyama |
|
On Computational Power of Insertion-Deletion Systems without Using Contexts
Sadaki Hirose (Toyama Univ.), Satoshi Okawa (The Univ. of Aizu) |
An Insertion-Deletion system, first introduced in [1], is a theoretical computing model in the DNA computing framework b... [more] |
COMP2005-27
pp.59-62 |