Title :
Research of Using Dynamic Programming in the Nodes Encoding Optimization
Author :
Minyi Ke ; Jie Chen ; Huazhong Jin
Author_Institution :
Sch. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China
Abstract :
In mathematics and computer science, dynamic programming is a method of solving complex problems by breaking them down into simpler steps. In this paper, we present a novel algorithm to select an optimal boundary node as the initial node, the selection of next node with use of dynamic planning based on the analysis of nodes encoding with the use of Cuthill-Mckee algorithm. And proper supplement is made for the network node definition in the graph theory with the combination of finite metadata calculation.
Keywords :
dynamic programming; encoding; graph theory; meta data; network theory (graphs); Cuthill-Mckee algorithm; computer science; dynamic planning; dynamic programming; finite metadata calculation; graph theory; mathematics; network node definition; nodes encoding optimization; optimal boundary node; Bandwidth; Computer science; Costs; Dynamic programming; Electronic mail; Encoding; Graph theory; Mathematics; Sparse matrices; Transmission line matrix methods;
Conference_Titel :
Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4994-1
DOI :
10.1109/ICIECS.2009.5363278
