Design and Analysis of Algorithms: A Contemporary Perspective, Sandeep Sen, Amit Kumar

Автор: Cormen, Thomas H., E
Название: Introduction to algorithms 3 ed.
ISBN: 0262033844 ISBN-13(EAN): 9780262033848
Издательство: MIT Press
Рейтинг:
Цена: 27588.00 р.
Наличие на складе: Нет в наличии.

Описание: A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.

Автор: Manlove David
Название: Algorithmics of Matching Under Preferences
ISBN: 9814425249 ISBN-13(EAN): 9789814425247
Издательство: World Scientific Publishing
Рейтинг:
Цена: 26136.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. This book deals with this topic.

Название: Advances in Computational Algorithms and Data Analysis
ISBN: 9048180279 ISBN-13(EAN): 9789048180271
Издательство: Springer
Рейтинг:
Цена: 27251.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text is a compendium of revised and extended articles written for the international conference on Advances in Computational Algorithms and Data Analysis. It presents state-of-the-art advances in the field through discussion of various topics.

Автор: Alsuwaiyel M H
Название: Algorithms: Design Techniques And Analysis (Revised Edition)
ISBN: 9814723649 ISBN-13(EAN): 9789814723640
Издательство: World Scientific Publishing
Рейтинг:
Цена: 22810.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Lekh Raj Vermani, Shalini Vermani
Название: An Elementary Approach to Design and Analysis of Algorithms
ISBN: 1786346753 ISBN-13(EAN): 9781786346759
Издательство: World Scientific Publishing
Рейтинг:
Цена: 17424.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 'The book under review is an interesting elaboration that fills the gaps in libraries for concisely written and student-friendly books about essentials in computer science ... I recommend this book for anyone who would like to study algorithms, learn a lot about computer science or simply would like to deepen their knowledge ... The book is written in very simple English and can be understood even by those with limited knowledge of the English language. It should be emphasized that, despite the fact that the book consists of many examples, mathematical formulas and theorems, it is very hard to find any mistakes, errors or typos.'zbMATHIn computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing 'output' and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.