Basics of programming and algorithms, principles and applications, Mantaci, Roberto Yunes, Jean-baptiste
Автор: Cormen, Thomas H. Название: Introduction to Algorithms 4E ISBN: 026204630X ISBN-13(EAN): 9780262046305 Издательство: Random House (USA) Рейтинг: Цена: 13794.00 р. Наличие на складе: Ожидается поступление.
Описание: 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.
Автор: Daniel J. Velleman Название: How to Prove It : A Structured Approach ISBN: 1108439535 ISBN-13(EAN): 9781108439534 Издательство: Cambridge Academ Рейтинг: Цена: 5861.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proofs play a central role in advanced mathematics and theoretical computer science, and this bestselling text`s third edition will help students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs, with a new chapter on number theory and over 150 new exercises.
Автор: Richard S. Bird, Jeremy Gibbons Название: Algorithm Design with Haskell ISBN: 1108491618 ISBN-13(EAN): 9781108491617 Издательство: Cambridge Academ Рейтинг: Цена: 8712.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents the five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. It serves students, teachers, researchers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms.
Автор: Rajiv Chopra, S. Raheja Название: Algorithm Design Basics: A Self-Teaching Introduction ISBN: 1683924487 ISBN-13(EAN): 9781683924487 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 7623.00 р. Наличие на складе: Поставка под заказ.
Описание: Provides a self-teaching introduction to the basic concepts of algorithm design and analysis. The book covers basic topics such as strings, trees, patterns, and graphs, but also includes advanced algorithms and provides lab exercises and numerous end-of-chapter exercises with answers, to test comprehension of the material.
Автор: Wilkinson Название: Grid Computing ISBN: 1138116068 ISBN-13(EAN): 9781138116061 Издательство: Taylor&Francis Рейтинг: Цена: 11942.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Designed for senior undergraduate and first-year graduate students, Grid Computing: Techniques and Applications shows professors how to teach this subject in a practical way. Extensively classroom-tested, it covers job submission and scheduling, Grid security, Grid computing services and software tools, graphical user interfaces, workflow editors, and Grid-enabling applications.
The book begins with an introduction that discusses the use of a Grid computing Web-based portal. It then examines the underlying action of job submission using a command-line interface and the use of a job scheduler. After describing both general Internet security techniques and specific security mechanisms developed for Grid computing, the author focuses on Web services technologies and how they are adopted for Grid computing. He also discusses the advantages of using a graphical user interface over a command-line interface and presents a graphical workflow editor that enables users to compose sequences of computational tasks visually using a simple drag-and-drop interface. The final chapter explains how to deploy applications on a Grid.
The Grid computing platform offers much more than simply running an application at a remote site. It also enables multiple, geographically distributed computers to collectively obtain increased speed and fault tolerance. Illustrating this kind of resource discovery, this practical text encompasses the varied and interconnected aspects of Grid computing, including how to design a system infrastructure and Grid portal.
Supplemental Web Resources The author's Web site offers various instructional resources, including slides and links to software for programming assignments. Many of these assignments do not require access to a Grid platform. Instead, the author provides step-by-step instructions for installing open-source software to deploy and test Web and Grid services, a Grid computing workflow editor to design and test workflows, and a Grid computing portal to deploy portlets.
Автор: Hiroshi Nagamochi, Toshihide Ibaraki Название: Algorithmic Aspects of Graph Connectivity ISBN: 1108735495 ISBN-13(EAN): 9781108735490 Издательство: Cambridge Academ Рейтинг: Цена: 6970.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.
Описание: Partial differential equations are one of the most used widely forms of mathematics in science and engineering. Two fractional PDEs can be considered, fractional in time, and fractional in space. This volume is directed to the development and use of SFPDEs, providing a discussion of applications from classical integer PDEs.
Автор: Cormen, Thomas H., E Название: Introduction to algorithms 3 ed. ISBN: 0262033844 ISBN-13(EAN): 9780262033848 Издательство: Random House (USA) Рейтинг: Цена: 16553.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.
Автор: Alsuwaiyel M H Название: Algorithms: Design Techniques And Analysis (Revised Edition) ISBN: 9814723649 ISBN-13(EAN): 9789814723640 Издательство: World Scientific Publishing Рейтинг: Цена: 28512.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.
Автор: Lanz Franz Название: User S Guide ISBN: 3110375486 ISBN-13(EAN): 9783110375480 Издательство: Walter de Gruyter Цена: 9288.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: For all users who work with ISPF on z/OS MVS. The readers of this book will learn how to use the ISPF professionally in their daily work in z/OS to quickly reach optimal results: - Detailed description of TSO/ISPF logon processes- Use of ISPF command tables- DSLIST - Optimal use of Data Set Lists- Use of Object / Action Workplace as an optimal work surface- Detailed description on use of the ISPF editor- Utilities for allocated data sets- Secret commands usable in ISPF- Descriptions for using the downloadable SMART ISPF Utilities The author gives many useful hints and tips based on his extensive experience working with ISPF. The applications of all the major ISPF commands are demonstrated by examples from practice.The book can be used as a teaching aid as well as a practical guide for daily work.
Название: Handbook of Finite State Based Models and Applications ISBN: 1138199354 ISBN-13(EAN): 9781138199354 Издательство: Taylor&Francis Рейтинг: Цена: 10104.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. Handbook of Finite State Based Models and Applications provides a complete collection of introductory materials on finite state theories, algorithms, and the latest domain applications. For beginners, the book is a handy reference for quickly looking up model details. For more experienced researchers, it is suitable as a source of in-depth study in this area.
The book first introduces the fundamentals of automata theory, including regular expressions, as well as widely used automata, such as transducers, tree automata, quantum automata, and timed automata. It then presents algorithms for the minimization and incremental construction of finite automata and describes Esterel, an automata-based synchronous programming language for embedded system software development.
Moving on to applications, the book explores regular path queries on graph-structured data, timed automata in model checking security protocols, pattern matching, compiler design, and XML processing. It also covers other finite state-based modeling approaches and applications, including Petri nets, statecharts, temporal logic, and UML state machine diagrams.
Автор: Mitzenmacher Название: Probability and Computing ISBN: 110715488X ISBN-13(EAN): 9781107154889 Издательство: Cambridge Academ Рейтинг: Цена: 8237.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
