Text

Mengukur kinerja algoritma genetik pada pemampatan matriks jarang

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 into genetic components. These components will be used by genetic operators 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.

Ketersediaan

Informasi Detail

Judul Seri

Integral;Vol.10 No.1 Maret 2005

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p.46-52

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

SPARSE MATRIX
GENETIC ALGORITHM
GENETIC OPERATORS
EXHAUSTIVE SEARCH ALGORITHM

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Nico Saputro, Joice Aritonang

Versi lain/terkait

Lampiran Berkas

Komentar