Fast Combinatorial Optimization With Parallel Digital Computers  

Oleh:

Okabe, Y. ; Kakeya, H.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 11 no. 6 (2000), page 1323-1331.
Topik: Digital; combinatorial; optimization; parallel digital; computers

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.4 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

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 eigenvectors 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.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali