Ditemukan 184 dokumen yang sesuai dengan query
Tarjan, Robert Endre
"There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms.
Four classical problems in network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time.
Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms."
Philadelphia: Society for Industrial and Applied Mathematics, 1983
e20448031
eBooks Universitas Indonesia Library
Berlin: Springer-Verlag, 1991
512.94 NAT c
Buku Teks SO Universitas Indonesia Library
Hu, T.C.
Reading Mass.: Addison-Wesley, 1982
511.6 HUT a
Buku Teks SO Universitas Indonesia Library
Jo Hendra Cajono
"Tugas akhir ini membahas sebuah algoritma yang menentukan apakah suatu sistim persamaan linier dan pertidaksamaan adalah konsisten. Jika konsisten, akan dicari sebuah solusinya (titik feasible). Juga dibahas analisa konvergensinya dan contoh-contoh perhitungan."
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1987
S-pdf
UI - Skripsi Membership Universitas Indonesia Library
Cham, Switzerland: Springer, 2017
629.892 COR r
Buku Teks Universitas Indonesia Library
Mackay, David J.C.
New York: Cambridge University Press, 2003
003.54 MAC i
Buku Teks SO Universitas Indonesia Library
Antonius Rachmat C.
Yogyakarta: Andi, 2010
005.1 ANT a
Buku Teks Universitas Indonesia Library
Novi Murniati
"DNA Sequencing by Hybridization (DNA SBH) adalah suatu proses pembentukan barisan nukleotida suatu rantai DNA dari kumpulan fragmen yang disebut spektrum. Spektrum tersebut diperoleh dari proses biokimia yang disebut hibridisasi. DNA SBH dapat dipandang sebagai masalah optimisasi yang dapat diselesaikan dengan menggunakan algoritma genetik. Prinsip kerja algoritma genetik berdasarkan pada teori evolusi Charles Darwin. Pada skripsi ini akan dibahas penerapan kinerja algoritma genetik pada DNA SBH. Terdapat tiga tahapan penting dalam algoritma genetik, yakni proses seleksi, crossover, dan mutasi. Jenis metode yang digunakan pada proses seleksi, crossover, dan mutasi secara berturut-turut adalah metode yang merupakan kombinasi antara roulette wheel dan deterministic, structured crossover, dan swap mutation. Kinerja algoritma genetik akan diuji dengan menggunakan data dari Gen Bank dan masalah DNA SBH yang dibuat secara acak. Selain itu juga akan dilihat pengaruh perubahan nilai probabilitas crossover (c) dan probabilitas mutasi (m) terhadap kinerja algoritma genetik untuk DNA SBH. Berdasarkan hasil percobaan diperoleh bahwa algoritma genetik cukup baik digunakan pada DNA SBH. Selain itu, perubahan nilai probabilitas crossover (c) dan probabilitas mutasi (m) ternyata mempengaruhi kinerja algoritma genetik dalam memperoleh solusi."
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 2009
S-Pdf
UI - Skripsi Membership Universitas Indonesia Library
"This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms."
Berlin: Springer-Verlag , 2012
e20408803
eBooks Universitas Indonesia Library
Fiacco, Anthony V.
"A reprint of the original volume, which won the Lanchester Prize awarded by the Operations Research Society of America for the best work of 1968. Although out of print for nearly 15 years, it remains one of the most referenced volumes in the field of mathematical programming.
Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions.
Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them."
Philadelphia: Society for Industrial and Applied Mathematics, 1990
e20450812
eBooks Universitas Indonesia Library