Design and evaluation of adaptive algorithms

点击翻译按钮获取中文摘要

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.