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

by Steven M. Kay

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

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 **IrGens** at Sept. 18, 2016

English | September 22, 2015 | ASIN: B014X01SS0, ISBN: 1501299352, 1501299387, 1501299360 | MP3@64 kbps | 13 hrs 3 mins | 360 MB

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

Posted by **Underaglassmoon** at June 3, 2016

Springer | Engineering | July 4, 2016 | ISBN-10: 3319340867 | 102 pages | pdf | 4.37 mb

Authors: Gaxiola, Fernando, Melin, Patricia, Valdez, Fevrier

Presents a mathematical analysis of the proposed learning method architecture and the adaptation of type-2 fuzzy weights

Presents simulation results and a comparative study among monolithic neural networks, neural network with type-1 fuzzy weights and neural network with type-2 fuzzy weights to illustrate the advantages of the proposed method

Posted by **roxul** at May 15, 2016

English | 2009 | ISBN: 3642022944 | 496 pages | PDF | 7 MB

Posted by **tanas.olesya** at April 22, 2016

English | Apr. 19, 2007 | ISBN: 3764381361 | 330 Pages | PDF | 3 MB

This volume contains six peer-refereed articles written on the occasion of the workshop Operator theory, system theory and scattering theory: multidimensional generalizations and related topics.

Posted by **AlenMiler** at April 6, 2016

English | Mar. 5, 2016 | ASIN: B01CMW3Y4M | 21 Pages | AZW3/MOBI/EPUB/PDF (conv) | 1.01 MB

Learn how to solve summations, functions, programs, and algorithms using asymptotic notation such as Big O, Big Omega, and Theta!