Hasil Pencarian  ::  Simpan CSV :: Kembali

Hasil Pencarian

Ditemukan 9401 dokumen yang sesuai dengan query
cover
International Symposium on Algorithms and Computaion
Berlin: Springer-Verlag, 1994
005.1 ISA a
Buku Teks SO  Universitas Indonesia Library
cover
Raymond Chiong, editor
"This book “Variants of Evolutionary Algorithms for Real-World Applications” aims to promote the practitioner’s view on EAs by providing a comprehensive discussion of how EAs can be adapted to the requirements of various applications in the real-world domains. It comprises 14 chapters, including an introductory chapter re-visiting the fundamental question of what an EA is and other chapters addressing a range of real-world problems such as production process planning, inventory system and supply chain network optimisation, task-based jobs assignment, planning for CNC-based work piece construction, mechanical/ship design tasks that involve runtime-intense simulations, data mining for the prediction of soil properties, automated tissue classification for MRI images, and database query optimisation, among others. "
Berlin: [, Springer], 2012
e20418128
eBooks  Universitas Indonesia Library
cover
Christina Trias Wulandari
"Generalized Assignment Problem (GAP) adalah masalah penugasan sehimpunan berhingga agen ke sehimpunan berhingga pekerjaan. Setiap pekerjaan mempunyai bobot dan setiap agen mempunyai kapasitas, sehingga setiap agen tidak dapat mengerjakan seluruh pekerjaan, tergantung kepada kapasitas yang dimiliki. Ada biaya yang harus dikeluarkan jika agen mengerjakan suatu pekerjaan. Pada skripsi ini akan dilihat kinerja dari algoritma Greedy Randomized Adaptive Search Procedure (GRASP) dalam menyelesaikan GAP. Algoritma GRASP terdiri dari 2 fase, yaitu fase konstruksi solusi awal dengan algoritma Greedy Randomized Adaptive Heuristics (GRAH) dan fase perbaikan dengan metode local search. Kinerja dari algoritma GRASP akan diukur berdasarkan kedekatan solusi yang diperoleh dengan Best Known Solution (BKS). Data masalah untuk menguji diambil dari OR Library. Berdasarkan hasil percobaan, dapat disimpulkan bahwa kinerja Algoritma GRASP dalam menyelesaikan GAP cukup baik untuk masalah GAP berukuran kecil, yaitu berukuran 5 x 15, 5 x 20, 5 x 25, 5 x 30, 8 x 24, 8 x 32."
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 2006
S27630
UI - Skripsi Membership  Universitas Indonesia Library
cover
Ricky Agus T
"Dibahas algoritma paralel Prefix Sums pada model komputer SIMD dengan model EREW SM SIMD dan model keterhubungan elemen prosesor berbentuk: Khusus, Unshuffle, Pohon dan Mesh dimensi 2. Kompleksitas waktu dari algoritma paralel Prefix Sums adalah:
O(log n) pada model EREW SM SIMD,
O(log n) pada keterhubungan Khusus,
O(log n) pada keterhubungan Unshuffle,
O(log n) I pada keterhubungan Pohon, dan
0(n112) I pada keterhubungan Mesh dimensi 2.
Algoritma paralel Prefix Sums mi dimanfaatkan dalam optimisasi masalah Knapsack.
"
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1994
S-pdf
UI - Skripsi Membership  Universitas Indonesia Library
cover
"This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications."
Berlin: Springer-Verlag, 2012
e20410472
eBooks  Universitas Indonesia Library
cover
Dion Ogi
"Perkembangan teknologi prosesor seperti multicore menjadi bagian dari pengembangan HPC. Pengujian terhadap algoritma paralel dengan MPICH2 dan Cilk++ menggunakan variabel jumlah proses dan core diharapkan dapat menunjukkan perbedaan kinerja (waktu proses) yang signifikan.
Analisis yang dilakukan pada hasil eksperimen menunjukkan implementasi algoritma paralel dengan MPICH2 memberikan speed-up hingga 5,987 pada perkalian matriks dan 4,175 pada pengurutan data (sorting) serta efisiensi hingga 0,967 dan 0,721 pada masing-masing aplikasi.
Sedangkan implementasi algoritma paralel dengan Cilk++ memberikan speed-up relatif hingga 25,126 pada perkalian matriks dan 9,105 pada pengurutan data (sorting) serta efisiensi relatif hingga 6,672 dan 2,593 pada masing-masing aplikasi.

Developments of processors technology like multicore become apart of HPC developments. The experiments that apply the parallel algorithms using MPICH2 and Cilk++ with variables at process and core amount are expected can show significant differences of the performance (process time).
The analysis done to the experiment results showed that the parallel algorithms implementation using MPICH2 give speed-up until 5.987 at matrix multiplication and 4.175 at data sorting also give efficiency until 0.967 and 0.721 at each following applications.
While the parallel algorithms implementation using Cilk++ give relative speed-up until 25.126 at matrix multiplication and 9.105 at data sorting also give relative efficiency until 6.672 and 2.593 at each following applications."
Depok: Fakultas Teknik Universitas Indonesia, 2010
T 27918
UI - Tesis Open  Universitas Indonesia Library
cover
"Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every attempt was made to verify the main claims. It is expected that most will appear in more complete form in scientific journals."
New York: ACM Press, 2001
e20449015
eBooks  Universitas Indonesia Library
cover
"The papers in this volume were presented at the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, held January 17-19, 2010, in Austin, TX. The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory."
Philadelphia: Society for Industrial and Applied Mathematics, 2010
e20443396
eBooks  Universitas Indonesia Library
cover
Sen, Sandeep
"The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods."
Cambridge: Cambridge University Press, 2019
005.1 SEN d
Buku Teks SO  Universitas Indonesia Library
cover
"This book constitutes the refereed proceedings of the 6th International Frontiers of Algorithmics Workshop, FAW 2012, and the 8th International Conference on Algorithmic Aspects in Information and Management, AAIM 2012, jointly held in Beijing, China, in May 2012. The 33 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and incentive analysis, biomedical imaging algorithms, communication networks and optimization, computational learning theory, knowledge discovery, and data mining, experimental algorithmic methodologies, optimization algorithms in economic and operations research, pattern recognition algorithms and trustworthy algorithms and trustworthy software."
Berlin: Springer-Verlag, 2012
e20410306
eBooks  Universitas Indonesia Library
<<   1 2 3 4 5 6 7 8 9 10   >>