Автор: Hromkovic, Juraj Название: Algorithmics for hard problems ISBN: 3642079091 ISBN-13(EAN): 9783642079092 Издательство: Springer Рейтинг: Цена: 13009 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies.
Описание: Computer-Aided Design and Manufacturing (CAD/CAM) is concerned with all aspects of the process of designing, prototyping, manufacturing, inspecting, and maintaining complex geometric objects under computer control. As such, there is a natural synergy between this field and Computational Geometry (CG), which involves the design, analysis, implementation, and testing of efficient algorithms and data representation techniques for geometric entities such as points, polygons, polyhedra, curves, and surfaces. The DIMACS Center (Piscataway, NJ) sponsored a workshop to further promote the interaction between these two fields. Attendees from academia, research laboratories, and industry took part in the invited talks, contributeresentations, and informal discussions. This volume is an outgrowth of that meeting. Topics covered in this volume include geometric modeling, computational topology, computational metrology, geometric constraint solving, part immobilization, geometric aspects of machining, layered manufacturing, and algebraic methods. The book is suitable for graduate students and researchers interested in geometric and algorithmic aspects of computer-aided design and manufacturing.
Автор: Manlove David Название: Algorithmics of Matching Under Preferences ISBN: 9814425249 ISBN-13(EAN): 9789814425247 Издательство: World Scientific Publishing Рейтинг: Цена: 28314 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Daming Zhu; Sergey Bereg Название: Frontiers in Algorithmics ISBN: 3319398164 ISBN-13(EAN): 9783319398167 Издательство: Springer Рейтинг: Цена: 8572 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: They deal with algorithm, complexity, problem, reduction, NP-complete, graph, approximation, linear programming, local search, integer programming, semidefinite programming, parameterized algorithm, fixed parameter, tractability, randomness, computational geometry.
Автор: Jianer Chen; John E. Hopcroft; Jianxin Wang Название: Frontiers in Algorithmics ISBN: 3319080156 ISBN-13(EAN): 9783319080154 Издательство: Springer Рейтинг: Цена: 8572 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 8th International Frontiers of Algorithmics Workshop, FAW 2014, held in Zhangjiajie, China, in June 2014. They provide a focused forum on current trends of research on algorithms, discrete structures, operations research, combinatorial optimization and their applications.
Автор: Mingyu Xiao; Frances Rosamond Название: Frontiers in Algorithmics ISBN: 3319596047 ISBN-13(EAN): 9783319596044 Издательство: Springer Рейтинг: Цена: 8417 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017. The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.
Автор: Harel David Название: Algorithmics ISBN: 3642272657 ISBN-13(EAN): 9783642272653 Издательство: Springer Рейтинг: Цена: 9948 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Название: Algorithmics of large and complex networks ISBN: 3642020933 ISBN-13(EAN): 9783642020933 Издательство: Springer Рейтинг: Цена: 8411 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Klaus P. Jantke; Steffen Lange Название: Algorithmic Learning for Knowledge-Based Systems ISBN: 3540602178 ISBN-13(EAN): 9783540602170 Издательство: Springer Рейтинг: Цена: 13774 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is the final report on a basic research project (GOSLER) on algorithmic learning for knowledge-based systems. The project focused on the study of fundamental learnability problems integrating theoretical research with the development of tools and experimental investigation.
Автор: Klaus P. Jantke; Shigenobu Kobayashi; Etsuji Tomit Название: Algorithmic Learning Theory ISBN: 3540573704 ISBN-13(EAN): 9783540573708 Издательство: Springer Рейтинг: Цена: 13315 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. It is organized into parts on inductive logic and inference; approximate learning; query learning; explanation-based learning; and new learning paradigms.
Автор: Setsuo Arikawa; Klaus P. Jantke Название: Algorithmic Learning Theory ISBN: 3540585206 ISBN-13(EAN): 9783540585206 Издательство: Springer Рейтинг: Цена: 15305 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains a number of research papers on current aspects of computational learning theory. The contributors focus on algorithmic learning, machine learning, analogical inference, inductive logic, case-based reasoning and formal language learning.
Автор: David Harel; Yishai Feldman Название: Algorithmics ISBN: 3642441351 ISBN-13(EAN): 9783642441356 Издательство: Springer Рейтинг: Цена: 9948 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru