Posted by **fdts** at Dec. 6, 2016

by Steven M. Kay

English | 2013 | ISBN: 013280803X | 496 pages | EPUB | 41.25 MB

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

HDRip | AVI | 640x344 | [email protected] Kbps | English [email protected] 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 **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 **johinson** at May 8, 2010

Springer | ISBN: 0792393627 | 1993 | PDF | 252 pages | 15.29 MB

Transformational programming and parallel computation are two emerging fields that may ultimately depend on each other for success. Perhaps because ad hoc programming on sequential machines is so straightforward, sequential programming methodology has had little impact outside the academic community, and transformational methodology has had little impact at all. However, because ad hoc programming for parallel machines is so hard, and because progress in software construction has lagged behind architectural advances for such machines, there is a much greater need to develop parallel programming and transformational methodologies. Parallel Algorithm Derivation and Program Transformation stimulates the investigation of formal ways to overcome problems of parallel computation, with respect to both software development and algorithm design. It represents perspectives from two different communities: transformational programming and parallel algorithm design, to discuss programming, transformational, and compiler methodologies for parallel architectures, and algorithmic paradigms, techniques, and tools for parallel machine models. Parallel Algorithm Derivation and Program Transformation is an excellent reference for graduate students and researchers in parallel programming and transformational methodology. Each chapter contains a few initial sections in the style of a first-year, graduate textbook with many illustrative examples. The book may also be used as the text for a graduate seminar course or as a reference book for courses in software engineering, parallel programming or formal methods in program development.

Posted by **johinson** at Oct. 24, 2009

MIT Press | ISBN: 0262133687 | 2000 | PDF | 231 pages | 26.64 MB

Optimizing compilers have a fundamental problem. No matter how powerful their optimizations are, they are no substitute for good application algorithms. Consider the case of sorting. For sufficiently large data sets, a merge sort algorithm compiled with a less powerful optimizer will always out-perform a selection sort algorithm compiled with the most powerful optimizer.

Posted by **nebulae** at Nov. 25, 2016

English | ISBN: 3319494864 | 2016 | 432 pages | PDF | 11 MB

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

WEBRip 720p | 1h 30mn | 1280x720 | MKV [email protected] 23.98fps | [email protected] 2CH 41.1KHz | 827.28 MiB

WEBRip 1080p | 1h 30mn | 1920x1080 | MKV [email protected] 23.98fps | [email protected] 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 **Underaglassmoon** at Oct. 31, 2016

Birkhäuser | Mathematics | November 24, 2016 | ISBN-10: 3319421794 | 596 pages | pdf | 4.92 mb

Authors: Alpay, Daniel

Elaborates on connections with electrical engineering and the theory of linear systems

Uses a variety of non-trivial and interesting examples as the basis for exercises (e.g. the Bohr phenomenon, integral representations of certain analytic functions, Blaschke products, and the Schur algorithm)

Some of the exercises use the notions of positive matrix, positive definite function and reproducing kernel Hilbert space

Posted by **IrGens** at Sept. 18, 2016

English | September 22, 2015 | ASIN: B014X01SS0, ISBN: 1501299352, 1501299387, 1501299360 | [email protected] kbps | 13 hrs 3 mins | 360 MB

Posted by **step778** at June 8, 2016