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 **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 **interes** at Jan. 1, 2014

English | 2011 | ISBN-10: 0132576279 | PDF | 576 pages | 5,3 MB

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7.

Posted by **Willson** at Nov. 27, 2016

English | 2005 | ISBN: 0521835402 | 307 pages | PDF | 25 MB

Posted by **ParRus** at Oct. 24, 2016

WEBRip | English | MP4 + PDF Guides + Excercises files | 960 x 540 | AVC ~76.2 kbps | 29.970 fps

AAC | 128 Kbps | 44.1 KHz | 2 channels | 28:38:37 | 2.78 GB

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. An introduction to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Specific topics covered include: union-find algorithms; basic iterable data types (stack, queues, and bags); sorting algorithms (quicksort, mergesort, heapsort) and applications; priority queues; binary search trees; red-black trees; hash tables; and symbol-table applications.