2001 Fiscal Year Final Research Report Summary
Design and evaluation of adaptive algorithms
| Project/Area Number |
10680337
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Tokyo University of Agriculture and Technology |
|---|
Principal Investigator |
NAKAMORI Mario Tokyo University of Agriculture and Technology, Department of Computer Science, Professor, 工学部, 教授 (00111633)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
IWASAWA Kyoko Tokyo University of Agriculture and Technology, Department of Computer Science, Associate Professor, 工学部, 助教授 (80251578)
IKEDA Satoshi Tokyo University of Agriculture and Technology, Department of Computer Science, Assistant Professor, 工学部, 助手 (70282796)
SHINANO Yuji Tokyo University of Agriculture and Technology, Department of Computer Science, Associate Professor, 工学部, 講師 (00297623)
|
|---|
| Project Period (FY) |
1998 – 2000
|
| Keywords | adaptive algorithm / algorithm / computational complexity / merge sort / graph isomorphism |
|---|
| Research Abstract |
An adaptive algorithm is a methodology which finds the characteristics of the data and applys the best method of solution for the data. In the present research we investigated adaptive algorithms for graph isomorphism, sort and merge, shortest path, and three dimensional assignment. As for sort and merge, we improved the so cal led merge-sort and proposed a new fast algorithm that requires only a few memory.
As for the shortest path, we proposed a hardware algorithm.
As for the graph isomorphism, we noticed the effect of preprocessing and investigated the relation. We proposed the layered graph preprocessing which determines the isomorphism quickly.
As for the three dimensional assignment, we proposed a method of combining imperfect components to make a reliable system.
|
