Posted by **serpmolot** at March 7, 2017

English | Last updated 2/2017 | mp4 | H264 1280x720 | AAC 2 ch | 9.5 hrs | 1.04 GB

Write code that run faster, use less memory and prepare

Posted by **MoneyRich** at Oct. 12, 2015

English | 8 Jun. 2011 | ISBN: 0857296639 | 612 Pages | PDF | 6 MB

Adaptive Control (second edition) shows how a desired level of system performance can be maintained automatically and in real time, even when process or disturbance parameters are unknown and variable. It is a coherent exposition of the many aspects of this field, setting out the problems to be addressed and moving on to solutions, their practical significance and their application.

Posted by **Underaglassmoon** at Dec. 13, 2014

English | Mathematics | August 25, 2011 | ISBN-10: 354071040X | 472 Pages | epub | 4.98 mb

Along with finite differences and finite elements, spectral methods are one of the three main methodologies for solving partial differential equations on computers.

Posted by **fdts** at June 11, 2014

by Ioan Doré Landau, Rogelio Lozano, Mohammed M'Saad, Alireza Karimi

English | 2011 | ISBN: 0857296639 | 609 pages | PDF | 6.47 MB

Posted by **ChrisRedfield** at May 8, 2014

Published: 2008-01-14 | ISBN: 0387720650, 1441924639 | PDF | 501 pages | 23 MB

Posted by **melia** at March 23, 2013

English | 2011 | ISBN: 0857296639 | 609 pages | PDF | 6.4 MB

Posted by **tot167** at June 24, 2011

Sp nger | 2011 | ISBN: 0857296639 | 609 pages | PDF | 6,4 MB

Posted by **AlenMiler** at June 10, 2017

English | 26 May 2017 | ASIN: B0728LNH39 | 623 Pages | AZW3 | 4.43 MB

Posted by **groovebeat** at Sept. 12, 2014

WEB-Rip | .RM | RealMedia Video | 320x240 | RealMedia Audio | 30 Hours | 3.49 GB

The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.

Posted by **ChrisRedfield** at Jan. 18, 2014

Published: 2011-11-28 | ISBN: 0132576279 | PDF | 640 pages | 4 MB