31st
JAN

The Art of Application Performance Testing: Help for Programmers and Quality Assurance

Posted by bandr under Algorithms

The Art of Application Performance Testing: Help for Programmers and Quality Assurance

The Art of Application Performance Testing: Help for Programmers and Quality Assurance

Product Description
This practical book provides a step-by-step approach to testing mission-critical applications for scalability and performance before they’re deployed — a vital topic to which other books devote one chapter, if that.

Read more ...

13th
JAN

Default Collective Intelligence in Action

Posted by IDM under Algorithms, General Programming, Science & Engineering, Software Development

TITLE : Collective Intelligence in Action
TYPE : Computer/Programming
AUTHOR : Satnam Alag
PUBLISHER : Manning Publications
ISBN : 1933988312
PAGES : 425 pages
EDITION : 1st
LANGUAGE : ENGLISH
RELEASE DATE: Unknown

RELEASE NOTES :
There’s a great deal of wisdom in a crowd, but how do you listen to a thousand people talking at once? Identifying the wants, needs, and knowledge of internet users can be like listening to a mob.

Read more ...

11th
JAN

Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions

Posted by bandr under Algorithms

Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions

Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions

Product Description

This textbook should be useful for graduate students, practicing engineers, and researchers who wish to thoroughly understand the detailed step-by-step algorithms, used during the finite element (truly sparse) assembly, the “direct” and “iterative” sparse equation * eigen-solvers and incorporating the DD formulation for efficient parallel computation.

Read more ...

10th
JAN

Complexity Theory: Exploring the Limits of Efficient Algorithms

Posted by bandr under Algorithms

Complexity Theory: Exploring the Limits of Efficient Algorithms

Complexity Theory: Exploring the Limits of Efficient Algorithms

Product Description

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits what is possible with the available resources. The results prevent the search for non-existing efficient algorithms. The theory of NP-completeness has influenced the development of all areas of computer science. New branches of complexity theory react to all new algorithmic concepts.

Read more ...

24th
DEC

Practical Optimization: Algorithms and Engineering Applications

Posted by bandr under Algorithms

Practical Optimization: Algorithms and Engineering Applications

Practical Optimization: Algorithms and Engineering Applications

Product Description

Practical Optimization: Algorithms and Engineering Applications provides a hands-on treatment of the subject of optimization. A comprehensive set of problems and exercises makes the book suitable for use in one or two semesters of a first-year graduate course or an advanced undergraduate course. Each half of the book contains a full semester’s worth of complimentary yet stand-alone material. The practical orientation of the topics chosen and a wealth of useful examples also make the book suitable as a reference work for practitioners in the field.

Read more ...

13th
DEC

Code Complete (Microsoft Programming)

Posted by IDM under Algorithms, General Programming, Software Development

Product Description
“We were impressed by Code Complete…a pleasure to read, either straight through or as a reference. An invaluable $35 reference.” – PC Week. This runaway bestseller is a practical guide to software design that discusses the art and science of constructing software. Examples are provided in C, Pascal, Basic, Fortran, and Ada, but the focus is on successful programming techniques.

Read more ...

Page 5 of 10«12345678910»