| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2022)
Search Results: Keywords 'from:2022-05-19 to:2022-05-19'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2022-05-19 13:00 |
Online | Online | Transportation Problem on a Graph Tetsuo Asano (Kanazawa Univ.)  COMP2022-1 |
We consider a transportation problem defined on a node-weighted undirected graph. Weight is positive if the amount of c... [more] | COMP2022-1 pp.1-8 |
| COMP, IPSJ-AL | 2022-05-19 13:35 |
Online | Online | Transportation Problem Allowing Sending and Bringing Back Tetsuo Asano (Kanazawa Univ.) COMP2022-2 |
This paper considers a transportation problem on a weighted graph. The weights specify the amounts of commodities at no... [more] | COMP2022-2 pp.9-16 |
| COMP, IPSJ-AL | 2022-05-19 14:20 |
Online | Online | An Uniform Scattering Algorithm with d-Spacing by (d-1)-distance Visible Autonomous Mobile Robots Syunsuke Aizu, Yonghwan Kim, Yoshiaki Katayama (NITech) COMP2022-3 |
Distributed autonomous mobile robot system consisting of many mobile computational entities (called robots) achieves the... [more] | COMP2022-3 pp.17-24 |
| COMP, IPSJ-AL | 2022-05-19 14:55 |
Online | Online | A Self-Stabilizing Algorithm to Construct Node Disjoint Paths between Two Senders and Targets on a Biconnected Graph Takuma Kitaoka, Yonghwan Kim, Yoshiaki Katayama (NITech) COMP2022-4 |
A path is a sequence of consecutive nodes in the graph, and two paths are disjoint if the nodes included in the two path... [more] | COMP2022-4 pp.25-32 |
| COMP, IPSJ-AL | 2022-05-19 15:40 |
Online | Online | On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.) COMP2022-5 |
Broadcast-CONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the r... [more] | COMP2022-5 pp.33-38 |
| COMP, IPSJ-AL | 2022-05-19 16:15 |
Online | Online | Information Theory of Evolution
-- The Driving Force of Saltative Evolution -- Kumon Tokumaru (Researcher) COMP2022-6 |
The evolution s from Prokaryote to Eukaryote and the birth of vertebrates are saltative. Plausibly they take place as sy... [more] | COMP2022-6 pp.39-44 |
| COMP, IPSJ-AL | 2022-05-20 13:00 |
Online | Online | [Invited Talk]
Planning with Explanations for Finding Desired Meeting Points on Graphs Keisuke Otaki (TCRDL) COMP2022-7 |
Combinatorial optimization problems are ubiquitous for decision making. In real-world scenarios, a decision-maker needs ... [more] | COMP2022-7 p.45 |
| COMP, IPSJ-AL | 2022-05-20 14:10 |
Online | Online | Computational Power of A Memoryless Mobile Agent in Undirected Rings Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2022-8 |
We consider the system where a single mobile agent is deployed in an anonymous, oriented, and undirected ring of $n$ ver... [more] | COMP2022-8 pp.46-53 |
| COMP, IPSJ-AL | 2022-05-20 14:45 |
Online | Online | Energy-Constrained Autonomous Mobile Robots: Computational Power and Cross-Model Analysis Kevin Buchin (TU Dort.), Paola Flocchini (Univ. of Ottawa), Irina Kostitsyna, Tom Peters (TU Eind.), Nicola Santoro (Carleton Univ.), Koichi Wada (Hosei Univ.) COMP2022-9 |
We consider distributed systems of identical autonomous computational entities, called robots, moving and operating i... [more] |
COMP2022-9 pp.54-61 |
[Return to Top Page]