| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2005-01-28
09:30 |
Aichi |
Nagoya University |
Graph-theoretic algorithm for {2,3}-EC-SNDP
Hiroki Katsuya, Takao Ono, Tomio Hirata (Nagoya Univ.) |
[more] |
COMP2004-60
pp.1-8 |
| COMP |
2005-01-28
09:55 |
Aichi |
Nagoya University |
A Modified Greedy Algorithm for the Set Multicover Problem
Hidekazu Kurahashi (Nagoya Univ.), Toshihiro Fujito (Toyohashi Univ. Tech.) |
[more] |
COMP2004-61
pp.9-16 |
| COMP |
2005-01-28
10:20 |
Aichi |
Nagoya University |
On Local Improvement Search for Weighted Set Packing
Masatomo Otake (Nagoya Univ.), Toshihiro Fujito (Toyohashi Univ.Tech.) |
[more] |
COMP2004-62
pp.17-22 |
| COMP |
2005-01-28
10:55 |
Aichi |
Nagoya University |
An Asynchronous Distributed Branch and Bound for Load Balancing
Atsushi Sasaki, Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
We propose a new asynchronous distributed branch and bound algorithm for a load balancing problem in which each variable... [more] |
COMP2004-63
pp.23-32 |
| COMP |
2005-01-28
11:20 |
Aichi |
Nagoya University |
Inferring Pedigrees from Genetic Distances
Takeyuki Tamura, Hiro Ito, Kazuo Iwama (Kyoto Univ.) |
A phylogenetic tree is a tree data structure which shows
evolutionary interrelationships among species
which are belie... [more] |
COMP2004-64
pp.33-39 |
| COMP |
2005-01-28
11:45 |
Aichi |
Nagoya University |
Application of parsing trees to the Dictionary Editing System
Kiyoshi Narita, Takumi Kasai (UEC) |
[more] |
COMP2004-65
pp.41-46 |
| COMP |
2005-01-28
13:30 |
Aichi |
Nagoya University |
Partitioning Graphs of Supply and Demand
Takehiro Ito, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Assume that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive integer, ... [more] |
COMP2004-66
pp.47-56 |
| COMP |
2005-01-28
13:55 |
Aichi |
Nagoya University |
Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs
Kazuya Watanabe, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) |
[more] |
COMP2004-67
pp.57-66 |
| COMP |
2005-01-28
14:20 |
Aichi |
Nagoya University |
Performance Evaluation of PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
Yoshitaka Shimoda, Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) |
[more] |
COMP2004-68
pp.67-76 |
| COMP |
2005-01-28
14:55 |
Aichi |
Nagoya University |
Guaranteed-Quality Anisotropic Mesh Generation for Parametric Surfaces
Yusuke Yokosuka, Keiko Imai (Chuo Univ.) |
In this paper, we propose a method of generating guaranteed-quality meshes for parametric surfaces. Some applications de... [more] |
COMP2004-69
pp.77-82 |
| COMP |
2005-01-28
15:20 |
Aichi |
Nagoya University |
Algorithms and Implementation of Peak-Reducing Fitting of a Curve
Masato Yuki, Jinhee Chun (Tohoku Univ.), Kunihiko Sadakane (Kyushu Univ.), Takeshi Tokuyama (Tohoku Univ.) |
The problem of approximating complexity curves is basic operation for processing of geometry data. In this paper, we emp... [more] |
COMP2004-70
pp.83-89 |
| COMP |
2005-01-28
15:45 |
Aichi |
Nagoya University |
On Checkerboard Rounding : Theory and Implementation
Yutaka Hirokawa, Takeshi Tokuyama (Tohoku Univ.) |
Motivated by digital halftoning application to convert a countinious-tone image into a binary image, we discusses how to... [more] |
COMP2004-71
pp.91-96 |
| COMP |
2005-01-28
16:10 |
Aichi |
Nagoya University |
Score Sequence Pair Problems of (r11,r12,r22)-Tournaments
-- Determination --
Masaya Takahashi (Fukuoka Inst. of Tech./Waseda Univ.), Takahiro Watanabe, Takeshi Yoshimura (Waseda Univ.) |
[more] |
COMP2004-72
pp.97-106 |