Chee k yap (67 resultados)

Condición: New.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New.

Condición: New.

Condición: New.

Condición: New.

Condición: very good. First edition, first impression. Hardcover book. Laminated boards. 305pp. With figures and diagrams in texts throughout. Seven sections by various authors, including : The Challenge of Robotics for Computer Science; Computational Geometry; Algorithmic Motion PLanning; Intersection and Proximity Problems and Voronoi Diagrams.This copy appears to have belonged to a UK company's technical library from the address stamp to flyleaf, and a pen number added to top front cover: otherwise very good condition, with light spotting/browning to closed page edges, light mark to back cover. Pictures available. …

Condición: New.

Condición: New.

Condición: New.

Condición: New.

Taschenbuch. Condición: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.…

Paperback. Condición: New. Print on Demand. This book presents a theoretical construction that provides a quantitative lower bound for the degree of Grobner bases, a class of sets used to solve systems of polynomial equations. The author's method hinges on Thue systems, a type of formal grammar used to model computation. By establishing a connection between the two, the author demonstrates that Grobner bases can have a high degree of complexity, specifically a double-exponential relationship with the number of variables in the underlying system. This insight contributes to the ongoing research on Grobner bases and their computational limits, advancing our understanding of these essential tools in polynomial algebra. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Paperback. Condición: New. Print on Demand. This book presents a framework for understanding the notion of concavity in rectilinear regions, exemplified by rectangular shapes. The author develops a combinatorial definition of concavity, which is then used to categorize different levels of concavity, including the familiar notion of convexity. The book investigates the problem of finding the largest rectilinear convex region within a given rectilinear region, presenting an efficient algorithm for solving this problem. The author also explores related problems, such as finding the largest convex region with specific properties, providing valuable insights into the nature and properties of rectilinear shapes. This book will appeal to mathematicians and computer scientists interested in computational geometry and the analysis of geometric shapes. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. …

Paperback. Condición: New. Print on Demand. This book leverages the retraction method to develop efficient algorithms for coordinating motion among multiple discs in the presence of obstacles. The retraction approach simplifies the complex problem of coordinating multiple discs by decomposing it into a series of elementary motions and discontinuities, leading to a significant reduction in the number of steps required to find a coordinated motion. This approach has proven superior to previous decomposition-based methods, demonstrating its effectiveness in optimizing motion planning. The book explores the inherent complexity of coordinating multiple discs and presents a comprehensive analysis of elementary motions and discontinuities, resulting in the development of a canonical coordinated motion graph. This graph serves as a powerful tool for searching and finding coordinated motions, providing a systematic approach to solving this challenging problem. The author's insights offer valuable contributions to the field of motion planning, paving the way for further advancements in this domain. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Paperback. Condición: New. Print on Demand. This book offers novel insights into the theoretical limits of computer science's ability to solve a fundamental problem: understanding and manipulating symbolic expressions. At the heart of this research lies an intricately constructed mathematical system that challenges the capabilities of algorithms to represent and analyze data. The author meticulously explores the interplay between mathematical theory and algorithmic complexity, delving into concepts like commutative Thue systems and their relation to polynomial ideals. Through these investigations, the book sheds light on the inherent computational difficulty of solving symbolic problems, providing valuable theoretical frameworks and benchmarks for future research in computer science and related fields. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Paperback. Condición: New. Print on Demand. This book introduces a groundbreaking algorithm that solves the Voronoi diagram problem, greatly improving on existing approaches. Voronoi diagrams are geometric structures used in fields such as biology, computer graphics, geographic optimization, and robotics. The author's novel technique enables the computation of these diagrams in O(nlogn) time, a significant advance over previous O(n^2) algorithms. This enhancement extends the applicability of Voronoi diagrams, facilitating their use in complex real-world scenarios. The book presents clear theoretical explanations and practical implementation details, empowering readers to utilize the algorithm effectively. The author's work expands the capabilities of Voronoi diagrams, offering new possibilities for problem-solving in various domains. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Paperback. Condición: New. Print on Demand. This book explores how to solve motion-planning problems in robotics, where a robot must plan its movements to navigate around obstacles in its environment. The focus of this book is on one specific type of motion-planning problem, known as the door-width problem. The door-width problem asks how wide a door must be for a given robot to pass through it. The author develops an algorithm that can compute the door-width of a robot in O(n^2) time, where n is the number of vertices in the robot's polygonal representation. This algorithm is optimal among algorithms that must construct a graph of size O(n^3). The author also discusses several other related problems, such as the ring-width problem and the elastic width problem. These problems ask how wide a ring or an elastic band must be for a robot to pass through it. The author concludes by discussing the significance of these insights on the broader field of motion planning. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Condición: New.

Condición: New. In.

PF. Condición: New.