Search algorithms: Generality found
β Scribed by Trabesinger, Andreas
- Book ID
- 109945324
- Publisher
- Nature Publishing Group
- Year
- 2007
- Tongue
- English
- Weight
- 120 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1745-2473
- DOI
- 10.1038/nphys533
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods, applied to various combinatorial structures, such as combinations, permutations, graphs, and designs. Many classical areas are covered as well
In this paper, we propose two fast codebook generation algo-book. Some alternative methods are also available [14]. rithms by making use of the information in the iterative process. The pairwise Nearest Neighbor (PNN) algorithm is a new Comparing to the conventional full search method (the LBG alter