2009 Fiscal Year Final Research Report
Design and Analysis of Algorithms for Insufficient Information
| Project/Area Number |
19200001
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (A)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
IWAMA Kazuo Kyoto University, 情報学研究科, 教授 (50131272)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KATOH Naoki 京都大学, 工学研究科, 教授 (40145826)
ITO Hiro 京都大学, 情報学研究科, 准教授 (50283487)
MIYAZAKI Shuichi 京都大学, 学術情報メディアセンター, 准教授 (00303884)
TAMAKI Suguru 京都大学, 情報学研究科, 助教 (40432413)
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
SUGIHARA Kokichi 明治大学, 研究・知財戦略機構, 特任教授 (40144117)
TOKUYAMA Takeshi 東北大学, 情報科学研究科, 教授 (40312631)
YAMASHITA Masafumi 九州大学, システム情報科学研究院, 教授 (00135419)
WATANABE Osamu 東京工業大学, 情報理工学研究科, 教授 (80158617)
HORIYAMA Takashi 埼玉大学, 理工学研究科, 准教授 (60314530)
|
|---|
| Project Period (FY) |
2007 – 2009
|
| Keywords | アルゴリズム理論 / 理論的性能保証 |
|---|
| Research Abstract |
One of the main challenge in modern algorithm design is to cope with insufficient information (to complement information). In this study, we rigorously discuss the desirable property of such algorithms and try to construct a framework for it including design techniques and evaluation method. As a result, we obtain efficient algorithms in various fields such as online, network, matching, randomized, geometric and distributed algorithms.
|
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Distance k-Sectors Exist.2010
Author(s)
Keiko Imai, Akitoshi Kawamura, Jiri Matousek, Daniel Reem, Takeshi Tokuyama
Organizer
26th Annual Symposium on Computational Geometry
Place of Presentation
Snowbird, Utah.
Year and Date
2010-06-15
-
-
-
-
-
-
-
-
-
-
-
-
