Posted by **rwdfox** at Nov. 17, 2016

WEBRip 720p | 1h 30mn | 1280x720 | MKV AVC@1084Kbps 23.98fps | AAC@192Kbps 2CH 41.1KHz | 827.28 MiB

WEBRip 1080p | 1h 30mn | 1920x1080 | MKV AVC@1740Kbps 23.98fps | AAC@126Kbps 2CH 41.1KHz | 1.18 GiB

A freelance computer hacker discovers a mysterious government computer program. He breaks into the program and is thrust into a revolution.

Posted by **Without** at March 17, 2016

HDRip | AVI | 640x344 | XviD@943 Kbps | English MP3@128 Kbps | 2 channels | 1h 30mn | 698 MB

A freelance computer hacker discovers a mysterious government computer program. He breaks into the program and is thrust into a revolution.

Posted by **fdts** at Dec. 26, 2015

by Geoffrey McLachlan, Thriyambakam Krishnan

English | 2008 | ISBN: 0471201707 | 385 pages | PDF | 7.93 MB

Posted by **nebulae** at Dec. 4, 2015

English | ISBN: 3662479257 | 2015 | 484 pages | PDF | 24 MB

Posted by **house23** at Nov. 9, 2015

MP4 | AVC 76kbps | English | 960x540 | 29.97ps | 19h 04mins | AAC stereo 108kbps | 1.67 GB

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments. You’ll learn what NP-completeness and the famous “P vs. NP” problem mean for the algorithm designer. Finally, we’ll study several strategies for dealing with hard (i.e., NP-complete problems), including the design and analysis of heuristics. Learn how shortest-path algorithms from the 1950s (i.e., pre-ARPANET!) govern the way that your Internet traffic gets routed today; why efficient algorithms are fundamental to modern genomics; and how to make a million bucks in prize money by “just” solving a math problem!

Posted by **tanas.olesya** at Aug. 27, 2015

English | 2011 | ISBN: 1439807027 | 334 pages | PDF | 3 MB

First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis.

Posted by **BUGSY** at Aug. 24, 2015

English | Oct. 15, 2003 | ISBN: 0824747011 | 214 Pages | PDF | 5 MB

Exploring the application and formulation of the EM algorithm, The EM Algorithm and Related Statistical Models offers a valuable method for constructing statistical models when only incomplete information is available, and proposes specific estimation algorithms for solutions to incomplete data problems.

Posted by **tanas.olesya** at March 17, 2015

English | Jan 21, 2006 | ISBN: 0898716101 | 292 Pages | PDF | 39 MB

The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures.

Posted by **Underaglassmoon** at March 2, 2015

Springer | Artificial Intelligence, Architecture, Electrical & Electronics | April 14 2015 | ISBN-10: 3319159542 | 64 pages | pdf | 5.63 mb

This work addresses the research and development of an innovative optimization kernel applied to analog integrated circuit (IC) design.

Posted by **Alimok** at July 17, 2014