Report of Algorithmic Language ALGOL 68, Adriaan van van Wijngaarden

Автор: Backhouse
Название: Algorithmic Problem Solving
ISBN: 0470684534 ISBN-13(EAN): 9780470684535
Издательство: Wiley
Рейтинг:
Цена: 46410.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: * Novel approach to the mathematics of problem solving, in particular how to do logical calculations. * Many of the problems are well-known from (mathematical) puzzle books. * The solution method in the book is new and more relevant to the true nature of problem solving in the modern IT-dominated world.

Автор: Moulay Barkatou; Thomas Cluzeau; Georg Regensburge
Название: Algebraic and Algorithmic Aspects of Differential and Integral Operators
ISBN: 3642544789 ISBN-13(EAN): 9783642544781
Издательство: Springer
Рейтинг:
Цена: 44720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constructions of Free Commutative Integro-Differential Algebras.- Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras.- Operational Calculi for Nonlocal Cauchy Problems in Resonance Cases.- Intertwining Laplace Transformations of Linear Partial Differential Equations.- Composing and Factoring Generalized Green's Operators and Ordinary Boundary Problems.- Relativistic Coulomb Integrals and Zeilberger's Holonomic Systems Approach II.- Multivariate Dimension Polynomials of Inversive Difference Field Extensions.- Differential (Monoid) Algebra and More.- Exact Solution of Local and Nonlocal BVPs for the Laplace Equation in a Rectangle.

Автор: Stefan Hougardy; Jens Vygen
Название: Algorithmic Mathematics
ISBN: 3319395572 ISBN-13(EAN): 9783319395579
Издательство: Springer
Рейтинг:
Цена: 41920.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++.This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this 'Algorithmic Mathematics' course at the University of Bonn several times in recent years.

Автор: Ulrich Faigle; W. Kern; G. Still
Название: Algorithmic Principles of Mathematical Programming
ISBN: 9048161177 ISBN-13(EAN): 9789048161171
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.
The book is equally suited for self-study for a motivated beginner and for a comprehensive course on the principles of mathematical programming within an applied mathematics or computer science curriculum at advanced undergraduate or graduate level. The presentation of the material is such that smaller modules on discrete optimization, linear programming, and nonlinear optimization can easily be extracted separately and used for shorter specialized courses on these subjects.

Автор: Daniel Robertz
Название: Formal Algorithmic Elimination for PDEs
ISBN: 3319114441 ISBN-13(EAN): 9783319114446
Издательство: Springer
Рейтинг:
Цена: 41920.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Introduction.- Formal Methods for PDE Systems.- Differential Elimination for Analytic Functions.- Basic Principles and Supplementary Material.- References.- List of Algorithms.- List of Examples.- Index of Notation.- Index.

Название: Algorithmics of large and complex networks
ISBN: 3642020933 ISBN-13(EAN): 9783642020933
Издательство: Springer
Рейтинг:
Цена: 51200.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A state-of-the-art survey that reports on the progress made in selected areas of this important and growing field, aiding the analysis of existing networks and the design of new and more efficient algorithms for solving various problems on these networks.

Автор: Peter Seibt
Название: Algorithmic Information Theory
ISBN: 3642069789 ISBN-13(EAN): 9783642069789
Издательство: Springer
Рейтинг:
Цена: 172350.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic Information Theory treats the mathematics of many important areas in digital information processing. It has been written as a read-and-learn book on concrete mathematics, for teachers, students and practitioners in electronic engineering, computer science and mathematics.

Автор: Gerhard Nierhaus
Название: Algorithmic Composition
ISBN: 3211999159 ISBN-13(EAN): 9783211999158
Издательство: Springer
Рейтинг:
Цена: 79190.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic composition - composing by means of formalizable methods - has a century old tradition not only in occidental music history. Topics covered are: markov models, generative grammars, transition networks, chaos and self-similarity, genetic algorithms, cellular automata, neural networks and artificial intelligence are covered.

Автор: David Harel; Yishai Feldman
Название: Algorithmics
ISBN: 3642441351 ISBN-13(EAN): 9783642441356
Издательство: Springer
Рейтинг:
Цена: 60550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives.

Автор: Harel David
Название: Algorithmics
ISBN: 3642272657 ISBN-13(EAN): 9783642272653
Издательство: Springer
Рейтинг:
Цена: 60550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This award-winning best-seller addresses the fundamentals of computer science. The authors discuss the design of algorithms, their efficiency and correctness, quantum algorithms, concurrency, large systems and artificial intelligence.

Автор: Shaun Forth; Paul Hovland; Eric Phipps; Jean Utke;
Название: Recent Advances in Algorithmic Differentiation
ISBN: 3642439918 ISBN-13(EAN): 9783642439919
Издательство: Springer
Рейтинг:
Цена: 153720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The proceedings represent the state of knowledge in the area of algorithmic differentiation (AD). The 31 contributed papers presented at the AD2012 conference cover the application of AD to many areas in science and engineering as well as aspects of AD theory and its implementation in tools.

Автор: Hromkovic, Juraj
Название: Algorithmics for hard problems
ISBN: 3642079091 ISBN-13(EAN): 9783642079092
Издательство: Springer
Рейтинг:
Цена: 79190.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies.