Tampilkan postingan dengan label Algorithms. Tampilkan semua postingan
Tampilkan postingan dengan label Algorithms. Tampilkan semua postingan

Rabu, 04 April 2012

Evolutionary Computation 1: Basic Algorithms and Operators

Ebook Download | Evolutionary Computation 1: Basic Algorithms and Operators | The first volume provides a very broad coverage of the "evolutionary" literature. Reading this first volume will probably save you a lot of time. The evolutionary literature actually becomes quite large these days. The focus of this first volume is on broad coverage, not details although some chapters are already quite advanced. If you need a fast coverage of the literature in evolutionary computation, this is the book. Pointers to all decisive contributions to the field are there. Reading from cover to cover might be difficult if the purpose is to introduce one to the field, but this is certainly the reference i would suggest to students and researchers new in this field. Each chapter is self-contained and references to the most important works for each chapter is provided at the end of the chapter.






Sabtu, 24 Maret 2012

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms,Part 1

Ebook Download | The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 | Knuth has written many books considered classics. Some of the previous works have been set-up for where the real fun is - Combinatorics. In one of my own columns, I say "Never trust the brute-force power of a computer network to do the job of a combinatorialist." In 1967, John P. Robinson and Arthur J. Bernstein published an optimal Golomb ruler with 24 marks (OGR24). Their solution was confirmed in 2004 by a massive distributed effort using tens of thousand of computer years.
Knuth is attempting to discuss all the algorithms that will still be important 50 years from now. The amount of speed given using these algorithms is staggering. Some examples topics in the book:
Page 222 - Algorithm S: Breadth-first synthesis of BDDs
Page 293 - Balanced and Complementary Gray codes.
Page 424 - Stirling numbers and set partitions.
Page 449 - Generating binary trees

Helpful mathematical illustrations feature prominently throughout the book, and pretty much every page is gorgeously formatted. Knuth developed TeX in part to produce beautiful books, and that is on display here. Many thoughtful questions are provided as an aid to learning these very useful techniques. The Answers section runs for 303 pages. It will take me months or years to digest most the information in this work, but I can't imagine a better presentation for this difficult but lucratively useful material.