Fast combinatorial optimization with parallel digital computers
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents an algorithm which realizes fast search for the solutions of combinatorial optimization problems with parallel digital computers. With the standard weight matrices designed for combinatorial optimization, many iterations are required before convergence to a quasioptimal solution even when many digital processors can be used in parallel, By removing the components of the eingenvectors with eminent negative eigenvalues of the weight matrix, the proposed algorithm avoids oscillation and realizes energy reduction under synchronous discrete dynamics, which enables parallel digital computers to obtain quasi-optimal solutions with much less time than the conventional algorithm.
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCの論文
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | 論文
- Preparation and Characterization of Nanofiber Nonwoven Textile for Electromagnetic Wave Shielding
- Statistical characteristics of atmospheric phase fluctuations observed by a VLBI system using a beacon wave from a geostationary satellite
- Cross-Talk Suppression in High-Density Printed Circuit Boards Using Magnetic Composite Filled in Spacing Between Signal Lines
- Development of an Electromagnetic Wave Shielding Textile by Electroless Ni-Based Alloy Plating
- Y-BA-CU-O THIN-FILMS BY EVAPORATING THE 3 ELEMENTS USING RESISTIVE HEATING