Techniques for Designing and Analyzing Algorithms, Stinson, Douglas Robert

Автор: Cormen, Thomas H.
Название: Introduction to Algorithms 4E
ISBN: 026204630X ISBN-13(EAN): 9780262046305
Издательство: MIT Press
Рейтинг:
Цена: 169290.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A comprehensive update of a widely used textbook, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Since the publication of the first edition, Introduction to Algorithms has become a widely used text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays.

Each chapter is relatively self-contained, presenting an algorithm, a design technique, an application area, or a related topic, and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The fourth edition has 140 new exercises and 22 new problems, and color has been added to improve visual presentations. The writing has been revised throughout, and made clearer, more personal, and gender neutral. The book's website offers supplemental material.

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.

Автор: Ashish Goel; Klaus Jansen; Jos? Rolim; Ronitt Rubi
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540853626 ISBN-13(EAN): 9783540853626
Издательство: Springer
Рейтинг:
Цена: 97820.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. This book reviews 20 revised papers of the APPROX 2008 workshop.

Автор: Irit Dinur; Klaus Jansen; Seffi Naor; Jos? Rolim
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3642036848 ISBN-13(EAN): 9783642036842
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 12th International Workshop APPROX 2009 and 13th International Workshop RANDOM 2009 Berkeley CA USA. .

Автор: Nadezhda M. Afanasyeva,Victor S. Borisov,Aleksandr
Название: Computational Technologies: A First Course
ISBN: 3110359928 ISBN-13(EAN): 9783110359923
Издательство: Walter de Gruyter
Цена: 49530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In this book wedescribe the basic elements of present computational technologies that use the algorithmic languages C/C++. The emphasis is on GNU compilers and libraries, FOSS for the solution of computational mathematics problems and visualization of the obtained data. At the beginning, a brief introduction to C is given with emphasis on its easy use in scientific and engineering computations.We describe the basic elements of the language, such as variables, data types, executable statements, functions, arrays, pointers, dynamic memory and file management. After that, we present some observations on the C++ programming language.We discuss the issues of program compiling, linking, and debugging. A quick guide to Eclipse is also presented in the book. The main features for editing, compiling, debugging and application assembling are considered.As examples, wesolve the standard problems of computational mathematics: operations with vectors and matrices, linear algebra problems, solution of nonlinear equations, numerical differentiation and integration, interpolation, initial value problems for ODEs and so on. Finally, basic features ofcomputational technologies are illustrated with model problems. All programs are implemented in C/C++ with using the GSL library. Gnuplot is employed to visualize the results of computations.

Автор: Alsuwaiyel M H
Название: Algorithms: Design Techniques And Analysis (Revised Edition)
ISBN: 9814723649 ISBN-13(EAN): 9789814723640
Издательство: World Scientific Publishing
Рейтинг:
Цена: 152070.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them.Algorithms: Design Techniques and Analysis advocates the study of algorithm design by presenting the most useful techniques and illustrating them with numerous examples — emphasizing on design techniques in problem solving rather than algorithms topics like searching and sorting. Algorithmic analysis in connection with example algorithms are explored in detail. Each technique or strategy is covered in its own chapter through numerous examples of problems and their algorithms.Readers will be equipped with problem solving tools needed in advanced courses or research in science and engineering.

Автор: Mitzenmacher
Название: Probability and Computing
ISBN: 110715488X ISBN-13(EAN): 9781107154889
Издательство: Cambridge Academ
Рейтинг:
Цена: 54910.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This greatly expanded new edition, requiring only an elementary background in discrete mathematics, comprehensively covers randomization and probabilistic techniques in modern computer science. It includes new material relevant to machine learning and big data analysis, plus examples and exercises, enabling students to learn modern techniques and applications.

Автор: Mourad Elloumi
Название: Algorithms for Next-Generation Sequencing Data
ISBN: 3319598244 ISBN-13(EAN): 9783319598246
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The 14 contributed chapters in this book survey the most recent developments in high-performance algorithms for NGS data, offering fundamental insights and technical information specifically on indexing, compression and storage;

Автор: Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc
Название: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ISBN: 3540424709 ISBN-13(EAN): 9783540424703
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001.

Автор: Dorit Hochbaum; Klaus Jansen; Jose D.P. Rolim; Ali
Название: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540663290 ISBN-13(EAN): 9783540663294
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text presents various new results within the areas covered by the workshop.

Автор: Atallah
Название: Algorithms and Theory of Computation Handbook, Volume 1
ISBN: 113811393X ISBN-13(EAN): 9781138113930
Издательство: Taylor&Francis
Рейтинг:
Цена: 80630.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many of the existing chapters, this second edition contains four new chapters that cover external memory and parameterized algorithms as well as computational number theory and algorithmic coding theory.

Автор: Ivan Stanimirovic?
Название: Hybrid Algorithms, Techniques and Implementations of Fuzzy Logic
ISBN: 1773613790 ISBN-13(EAN): 9781773613796
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 164470.00 T
Наличие на складе: Невозможна поставка.
Описание: Explores various aspects of Fuzzy logic, including an extensive overview of hybrid algorithms, techniques and implementations. The book includes definitions of evolutionary computation and fuzzy systems, ideologies and strategies.