Ditemukan 8 dokumen yang sesuai dengan query
Ruruh Wuryani, author
Dalam tesis dibahas pencocokan hampiran untai (approximate string matching) dari dua untai berbeda. Dalam meninjau tingkat kedekatan hampiran dua untai atau tingkat kemiripan dua untai digunakan ukuran Jarak Levenshtein, Dalam penentuan jarak tersebut digunakan metode program dinamik. Diperoleh beberapa sifat-sifat yang berhubungan dengan susunan kedua untai yang dicocokkan. Pada akhir...
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 2011
T29619
UI - Tesis Open Universitas Indonesia Library
Muhamad Nafis, author
Dibahas visualisasi kurva hampiran dengan menggunakan metode Hampiran B-Spline. Dalam hampiran ini diberikan sejumlah data koordinat, dengan menggunakan kombinasi linear dari sejumlah basis B-Spline akan diperoleh kurva hampiran yang dimaksud. Fungsi basis yang digunakan disini berderajat 1,2, dan 3. Kurva yang dihasilkan kemudian akan divisualisasikan pada jendela gratis. Jendela grafis...
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1996
S-pdf
UI - Skripsi Membership Universitas Indonesia Library
Dewi Safitri, author
ABSTRAK
Tugas akhir ini membahas tentang Algoritma pembesaran (augmeritasi) pada graph Campuran, yaitu penambahan ruas secara optimal pada graph Campuran sehingga diperoleh graph yang setiap ruasnya berada dalam sirkuit sederhana yang Traversabel atau graph terhubung kuat. Untuk rnendapatkan penambahan ruas yang optimal, graph Campuran disederhanakan kedalam bentuk graph Asiklik Campuran...
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1990
S-Pdf
UI - Skripsi Membership Universitas Indonesia Library
Gartner, Bernd, author
This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications,...
Berlin: Springer, 2012
e20419221
eBooks Universitas Indonesia Library
Ding-Zhu, Du, author
Unlike other books on theoretical computer science, this textbook organizes approximation algorithms into chapters based on the design techniques for the algorithms. based on the design techniques for the algorithms. It helps the reader to better understand the design and analysis techniques for approximation algorithms...
New York: [Springer, ], 2012
e20419407
eBooks Universitas Indonesia Library
This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of...
Berlin: Springer-Verlag, 2012
e20410515
eBooks Universitas Indonesia Library
Markovsky, Ivan, author
Data approximation by low-complexity models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory including, system and control...
London: [, Springer], 2012
e20410845
eBooks Universitas Indonesia Library
Zhening, Li, auhtor
In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted...
New York: [Springer, ], 2012
e20419242
eBooks Universitas Indonesia Library
