| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2008)
Search Results: Keywords 'from:2008-09-11 to:2008-09-11'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2008-09-11 09:00 |
Aichi | Nagoya Inst. of Tech. | Polygons Folding to Plural Incongruent Orthogonal Boxes Jun Mitani (Univ. of Tsukuba/JST), Ryuhei Uehara (JAIST)  COMP2008-23 |
We investigate the problem of finding orthogonal polygons that fold to plural in congruent orthogonal boxes. There are... [more] |
COMP2008-23 pp.1-8 |
| COMP | 2008-09-11 09:30 |
Aichi | Nagoya Inst. of Tech. | Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology) COMP2008-24 |
Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs in an $n$-vertex $m$-edge undirected graph $... [more] |
COMP2008-24 pp.9-16 |
| COMP | 2008-09-11 10:15 |
Aichi | Nagoya Inst. of Tech. | Average-case Analysis of Spectral Method for Clustering Ryo Sakaguchi (Tokyo Inst.Tech.) COMP2008-25 |
[more] | COMP2008-25 pp.17-22 |
| COMP | 2008-09-11 10:45 |
Aichi | Nagoya Inst. of Tech. | Analysis of a spectral method for random satisfiable 3CNF formulas Tomonri Ando (Tokyo Inst. Tech.) COMP2008-26 |
[more] | COMP2008-26 pp.23-28 |
| COMP | 2008-09-11 11:15 |
Aichi | Nagoya Inst. of Tech. | On presortedness measures of inputs for block sorting Shin'ichi Nakayama, Kojiro Kobayashi (Soka Univ.) COMP2008-27 |
Block sorting is to sort $n$ strings of length $n$ that are obtained from one string of length $n$ by circular shifts by... [more] | COMP2008-27 pp.29-36 |
| COMP | 2008-09-11 13:00 |
Aichi | Nagoya Inst. of Tech. | [Invited Talk]
On the hardness of reoptimization of NP-hard problems Juraj Hromkovic (ETH Zurich) COMP2008-28 |
[more] | COMP2008-28 pp.37-38 |
| COMP | 2008-09-11 14:20 |
Aichi | Nagoya Inst. of Tech. | Convergence problem of Mobile Robots with Uniformly-Inaccurate Sensors Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-29 |
(To be available after the conference date) [more] | COMP2008-29 pp.39-46 |
| COMP | 2008-09-11 14:50 |
Aichi | Nagoya Inst. of Tech. | On Gathering Problem in a Ring for 2n Autonomous Mobile Robots Kotaro Haba, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-30 |
This paper studies a gathering problem in a ring for $2n$ autonomous mobile robots. In [1] it is shown that gathering is... [more] | COMP2008-30 pp.47-54 |
| COMP | 2008-09-11 15:20 |
Aichi | Nagoya Inst. of Tech. | On Circle Formation by Four Autonomous Mobile Robots Keita Hashimoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-31 |
We consider a problem to make $n$ asynchronous autonomous mobile robots to form a regular $n$-gon. This problem is call... [more] |
COMP2008-31 pp.55-62 |
| COMP | 2008-09-11 16:10 |
Aichi | Nagoya Inst. of Tech. | An analysis of a generalized multi-organization scheduling on unrelated parallel machines Fukuhito Ooshita (Osaka Univ.), Tomoko Izumi, Taisuke Izumi (Nagoya Inst. of Tech.) COMP2008-32 |
We consider the grid where each organization provides a machine and several jobs to be executed. While cooperation of or... [more] | COMP2008-32 pp.63-70 |
| COMP | 2008-09-11 16:40 |
Aichi | Nagoya Inst. of Tech. | Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2008-33 |
The online buffer management problem formulates the problem of queuing policies of network switches supporting QoS (Qua... [more] |
COMP2008-33 pp.71-78 |
[Return to Top Page]