Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
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 Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.

Abstrak :
Penelitian ini bertujuan untuk menghasilkan jadwal mata kuliah di perguruan tinggi yang optimal, dengan mengurangi jumlah mata kuliah yang bentrok, serta distribusi kelas yang merata untuk meringankan beban mahasiswa. Untuk mencapai tujuan tersebut, optimasi jadwal dilakukan menggunakan algoritma genetika. Algoritma ini sangat cocok untuk menyelesaikan masalah skala besar dan kompleks, seperti penjadwalan mata kuliah di perguruan tinggi yang melibatkan banyak variabel dan kendala. Teknik local search digunakan untuk membantu algoritma genetika dalam meningkatkan kinerja dan mempercepat konvergensi. Penelitian ini diharapkan menghasilkan jadwal mata kuliah yang optimal berdasarkan kriteria jumlah mata kuliah yang bentrok, serta distribusi kelas yang merata untuk meringankan beban mahasiswa. Hasil penelitian menunjukkan bahwa jadwal baru yang optimal berhasil diperoleh. ......This research aims to produce an optimal college course schedule by reducing the number of conflicting courses and ensuring an even distribution of classes to ease the students' workload. To achieve this goal, schedule optimization uses a genetic algorithm. This algorithm is well-suited for solving large-scale and complex problems, such as college course scheduling that involves many variables and constraints. Local search techniques assist the genetic algorithm in improving performance and accelerating convergence. This research is expected to produce an optimal course schedule based on the criteria of minimizing course conflicts and evenly distributing classes to ease students' workload. The research results show that an optimal new schedule was successfully obtained.

Abstrak :
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.

Abstrak :
This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures.

Abstrak :
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.

Abstrak :
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.

Abstrak :
This book constitutes the refereed proceedings of the 5th International Symposium on Algorithmic Game Theory, SAGT 2012, held in Barcelona, Spain, in October 2012. The papers present original research at the intersection of algorithms and game theory and address various current topics such as solution concepts in game theory, efficiency of equilibria and price of anarchy, complexity classes in game theory, computational aspects of equilibria, computational aspects of fixed-point theorems, repeated games, evolution and learning in games, convergence of dynamics, coalitions, coordination and collective action; reputation, recommendation and trust systems, graph-theoretic aspects of social networks, network games; cost-sharing algorithms and analysis, computing with incentives, algorithmic mechanism design, computational social choice, decision theory, and pricing, auction algorithms and analysis, economic aspects of distributed computing, internet economics and computational advertising.

Abstrak :
This book constitutes the refereed proceedings of the 4th International Conference on Algebraic Biology, ANB 2010, held at the Castle of Hagenberg, Austria in July/August 2010. The conference is a follow up of the AB Conference. The 10 papers were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on mathematical modeling, system analysis and design, genomics, molecular structure analysis, automata theory, artificial intelligence, sequence analysis, automated reasoning, formal language and hybrid symbolic numerical methods.

Abstrak :
This book constitutes the refereed proceedings of the 7th International Workshop on Security, IWSEC 2012, held in Fukuoka, Japan, in November 2012. The 16 revised selected papers presented in this volume were carefully reviewed and selected from 53 submissions. They are organized in topical sections named: implementation; encryption and key exchange; cryptanalysis; and secure protocols.