Fundamentals of Computation Theory, Leszek G?sieniec; Frank Wolter

Автор: Sudebkumar Prasant Pal; Kunihiko Sadakane
Название: Algorithms and Computation
ISBN: 331904656X ISBN-13(EAN): 9783319046563
Издательство: Springer
Рейтинг:
Цена: 10201.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the revised selected papers of the 8th International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014.

Автор: Ralf Klasing; Marc Zeitoun
Название: Fundamentals of Computation Theory
ISBN: 3662557509 ISBN-13(EAN): 9783662557501
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, held in Bordeaux, France, in September 2017. The 29 revised full papers and 5 invited papers presented were carefully reviewed and selected from 99 submissions.

Автор: Adrian Kosowski; Igor Walukiewicz
Название: Fundamentals of Computation Theory
ISBN: 3319221760 ISBN-13(EAN): 9783319221762
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdansk, Poland, in August 2015. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms;

Автор: Andrew Childs; Michele Mosca
Название: Theory of Quantum Computation, Communication and Cryptography
ISBN: 3642106978 ISBN-13(EAN): 9783642106972
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Topics addressed are such as quantum algorithms, models of quantum computation, quantum complexity theory, simulation of quantum systems, quantum cryptography, quantum communication, quantum estimation and measurement, quantum noise, quantum coding theory, fault-tolerant quantum computing, and entanglement theory.

Автор: Tom Jenkyns; Ben Stephenson
Название: Fundamentals of Discrete Math for Computer Science
ISBN: 3319701509 ISBN-13(EAN): 9783319701509
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence.

Fundamentals of Discrete Math for Computer Science provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions.

Topics and features: highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expected; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.

This easy-to-understand and fun-to-read textbook is ideal for an introductory discrete mathematics course for computer science students at the beginning of their studies. The book assumes no prior mathematical knowledge, and discusses concepts in programming as needed, allowing it to be used in a mathematics course taken concurrently with a student's first programming course.

Автор: Carlos Cotta; Peter I. Cowling
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3642010083 ISBN-13(EAN): 9783642010088
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tubingen, Germany, in April 2009. This work contains papers that discuss developments and applications in metaheuristics.

Автор: Sandip Das; Ryuhei Uehara
Название: WALCOM: Algorithms and Computation
ISBN: 3642002013 ISBN-13(EAN): 9783642002014
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. This book presents the papers that feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms.

Автор: Jianer Chen; Fedor V. Fomin
Название: Parameterized and Exact Computation
ISBN: 3642112684 ISBN-13(EAN): 9783642112683
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 4th International Workshop IWPEC 2009 Copenhagen Denmark September 1011 2009 Revised Selected Paper. .

Автор: Md. Saidur Rahman; Satoshi Fujita
Название: WALCOM: Algorithms and Computation
ISBN: 3642114393 ISBN-13(EAN): 9783642114397
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 4th International Workshop WALCOM 2010 Dhaka Bangladesh February 1012 2010 Proceedings. .

Автор: Peter I. Cowling; Peter Merz
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3642121381 ISBN-13(EAN): 9783642121388
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010, held in Instanbul, Turkey, in April 2010. This book discusses developments and applications in metaheuristics.

Автор: Hee-Kap Ahn; Chan-Su Shin
Название: Algorithms and Computation
ISBN: 3319130749 ISBN-13(EAN): 9783319130743
Издательство: Springer
Рейтинг:
Цена: 12298.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Computational geometry.- Combinatorial optimization.- Graph algorithms.- Enumeration, matching and assignment.- Data structures and algorithms.- Fixed-parameter tractable algorithms.- Scheduling algorithms.- Computational complexity.- Approximation algorithms, graph theory and algorithms.- Online and approximation algorithms.- Network and scheduling algorithms.

Автор: Gabriela Ochoa; Francisco Chicano
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3319164678 ISBN-13(EAN): 9783319164670
Издательство: Springer
Рейтинг:
Цена: 6708.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem.- A Computational Comparison of Different Algorithms for Very Large p-median Problems.- A New Solution Representation for the Firefighter Problem.- A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem.- A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands.- An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows.- Analysis of Solution Quality of a Multi objective Optimization-Based Evolutionary Algorithm for Knapsack Problem.- Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization.- Hyper-heuristic Operator Selection and Acceptance Criteria.- Improving the Performance of the Germinal Center Artificial Immune System Using ε-Dominance: A Multi-objective Knapsack Problem.- Mixing Network Extremal Optimization for Community Structure Detection.- Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogeneous Electric Vehicles.- On the Complexity of Searching the Linear Ordering Problem Neighborhoods.- Runtime Analysis of (1 + 1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on ONEMAX+ZEROMAX Problem.- The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity.- The Sim-EA Algorithm with Operator Auto adaptation for the Multi objective Firefighter Problem.- True Pareto Fronts for Multi-objective AI Planning Instances.- Upper and Lower Bounds on Unrestricted Black-Box Complexity of JUMPn, l.- Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling