Mengukur Kinerja Algoritma Pada Pemampatan Matriks Jarang  

Oleh:

Saputro, Nico ; Aritonang, Joice

Jenis: Article from Bulletin/Magazine
Dalam koleksi: Integral: Majalah Ilmiah Matematika dan Ilmu Pengetahuan Alam vol. 10 no. 1 (Mar. 2005), page 46-52.
Topik: matriks; sparse matriks; genetic algorithm; genetic operators; exhaustive search algorithm

Ketersediaan

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

Lihat Detail Induk

Isi artikel

A matrix that has lots of zero elements is called a sparse matrix. A sparse matrix can be compressed by saving non zero elements. There are many algorithms used to compress a sparse matrix, one of them is genetic algorithm. Genetic algorithm is a searching algorithm by an evolutionary process resulting in a best solution. A sparse matrix is modeled intp genetic components. These components will be used by genetic operator to compress a sparse matrix. Then, we shall study the influence of genetic parameter in compressing a sparse matrix. Finally compression result from genetic algorithm will be compared with exhaustive search algorithm.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali