Address Analyzer Based on the Maximum Matching Algorithms |
|
| Journal | Key Engineering Materials (Volumes 460 - 461) |
|---|---|
| Volume | Components, Packaging and Manufacturing Technology |
| Edited by | Yanwen Wu |
| Pages | 296-299 |
| DOI | 10.4028/www.scientific.net/KEM.460-461.296 |
| Citation | Shu Min Zhou et al., 2011, Key Engineering Materials, 460-461, 296 |
| Online since | January, 2011 |
| Authors | Shu Min Zhou, Rui Chen, Bin Tang |
| Keywords | Address Tree, Code, Matching, Node, Optimization |
| Abstract | Based on the analysis of current zip code, this article put forward a new encoding algorithm of the address tree - the largest matching algorithm. This algorithm combines the characteristics of the address tree, considering the uniqueness of the address tree, raises a best matching theory, and taking into the matching speed of the address tree, brings in the associate floors of the node of the address tree to improve the efficiency of the match. Because of the change of the address tree, the address tree’s thesaurus in order to timely update its information, increase unknown node by intelligent means automatically. |
| Full Paper |
Get the full paper by clicking here
|
