| Budget Amount *help |
¥16,120,000 (Direct Cost: ¥12,400,000、Indirect Cost: ¥3,720,000)
Fiscal Year 2020: ¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2019: ¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2018: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2017: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2016: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
|
|---|
| Outline of Final Research Achievements |
Two keywords of this research is the insufficiency of input data and randomization to cope with that. We studied online algorithms for the car-sharing problem having drawn a lot of attention recently, and improved the previous results on the efficient resource allocation. For the spacial insufficiency of input data, we studied the property test problem that looks at only a constant-length portion of the input to obtain the property of the whole input, and figured out a strong relationship of its theory with the parameterized complexity theory, one of the most advanced fields in theoretical computer science. Our results include several others, e.g., a new formalization of the famous Tower of Hanoi Puzzle, which appeared in American Mathematical Monthly.
|
