Sharir m (94 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 21,71
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store US, Wood Dale, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 22,17
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,05
EUR 3,81 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,25
EUR 3,81 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: PBShop.store US, Wood Dale, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 28,77
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: Prominent Books, Hereford, Regno UnitoProminent Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 10,50
EUR 17,97 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: New. Next day dispatch (mon-fri). Please note orders sent to Netherlands or Sweden take slightly longer than the Amazon estimated delivery date. Same day/next day dispatch (mon-fri) all items checked before dispatch, Handled and sent out with care.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,63
EUR 13,89 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,63
EUR 13,89 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,63
EUR 13,89 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: PBShop.store US, Wood Dale, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 33,77
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: PBShop.store UK, Fairford, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 32,45
EUR 4,82 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: PBShop.store UK, Fairford, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 32,62
EUR 4,82 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 28,47
EUR 13,89 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 30,21
EUR 13,89 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 30,21
EUR 13,89 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,31
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book explores the practical applications of a new mathematical concept that addresses the problem of planning the shortest path between two points while avoiding obstacles. Most paths are comprised of a series of sub-paths; the author presents an innovative method by which to bre…ak down the larger problem into its component parts. These smaller sub-problems are solved, and the solutions are then reassembled to determine the complete shortest path. This method has applications in and beyond pure mathematics, touching on robotics and other engineering fields, and is likely to be an important new tool for researchers and practitioners alike. 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.
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,31
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book introduces an algorithm designed to locate the geodesic center of a simple polygon, which is a point inside the polygon with the minimal maximum distance to any point within the polygon. This geodesic center problem is an expansion of the classic Euclidean facility location…problem, where the objective is to find the point that minimizes the distance between the facility and the furthest point in a given set. The algorithm provided by the author calculates the geodesic center of a simple polygon in time O(n log2n), where n is the number of vertices in the polygon. This is an improvement over the existing algorithm by Asano and Toussaint, which achieves O(n4log n) time complexity. The book explores the geometric definitions of geodesic diameter and geodesic center, and explains how to compute the geodesic diameter of a given polygon using a method by Suri. It also discusses topics such as the link diameter and link center, P-convex sets, and shortest path trees within a polygon. The author presents a linear-time technique by Megiddo for linear programming in R2, which is utilized within the algorithm. By decomposing the problem into smaller subproblems and employing fast parallel algorithms, the author achieves efficient sequential optimization. Overall, this book provides a valuable contribution to the field of computational geometry, offering a practical algorithm for a complex problem and advancing the understanding of geodesic center computation. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,31
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book presents an efficient algorithm for identifying strongly connected components within directed graphs. The algorithm, developed by the author, offers a significant improvement over existing methods by producing components in reverse postorder and organizing nodes within each…component in the same order. This ordering facilitates iterative algorithms used in data flow analysis, leading to a simpler and more efficient approach. The book delves into the theoretical foundations of the algorithm, proving its correctness and analyzing its time complexity. It also explores applications in data flow analysis, demonstrating how the algorithm can enhance the accuracy and efficiency of data flow analysis problems. Overall, this book provides valuable insights into graph connectivity and offers a practical solution for optimizing data flow analysis in computer science applications. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,38
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book presents an innovative algorithm to determine whether two disjoint simple polygons can be moved by a sequence of translations to a position sufficiently far from each other without colliding, and if so, produces such a motion. The algorithm can also determine whether a given… polygon can be separated from another using a specified number of translations, and if so, produces a motion using the smallest number of translations or a motion with the shortest total translational distance. The problem that this book addresses is a special instance of the motion planning problem that seeks a purely translational collision-free motion of a polygonal object amidst a collection of polygonal obstacles. The author has shown that the existence of a motion of this type can be determined in time that is close to optimal. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,44
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book explores a specific geometry problem in the field of computer science involving the movement of objects within confined spaces. The author presents an analysis of the number of critical positions in which a convex polygonal object can make simultaneous contact with three obs…tacles while remaining free, meaning it does not penetrate any obstacle. Through mathematical proofs and an illustrative example, the book provides an insightful upper bound on the number of such critical positions. The author's analysis finds that the number of critical positions is dependent on the number of sides of the polygon and the number of obstacles, which is significant for designing efficient algorithms that enable collision-free motion planning for polygonal objects. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,44
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This insightful book explores the intriguing world of robot motion planning, examining the mathematical algorithms used to guide robots' smooth and efficient movement amidst complex environments. The author delves into the subject's rich history, tracing its evolution from early theor…etical concepts to present-day practical applications. By presenting a comprehensive analysis of the field's core techniques and challenges, this book sheds light on the intricate relationship between mathematics and robotics, showcasing the power of mathematical modeling in solving real-world problems. 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.
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,49
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book explores the complex problem of identifying and matching partially obscured objects in 2D and 3D scenes. Through the lens of noisy, incomplete data, the author explores efficient methods for smoothing data and matching portions of observed object boundaries to pre-stored mod…els. While similar techniques use tangent direction estimates to make matches, this book employs high-speed algorithms to calculate optimal rotations and translations for a given match. The approach also bears relation to methods described in [GLP84], [GLP85], but operates independently of any assumption that objects to be identified should be polygonal or polyhedral. Drawing on examples from computer vision, industrial environments, and more, this book offers a robust and efficient approach to object identification that can be applied to a wide range of problems. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,49
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book offers a novel structural analysis technique applicable to flow analysis in optimizing compilers. The technique extends methods developed to produce a program representation that detects and records structured control flow patterns. Enabled by this technique, the book presen…ts an approach to data flow analysis which is shown to be faster than interval-based methods. The author also discusses broader implications for flow graph-based program analysis and direct analysis of a program's parse tree. Using accessible and inviting language, the author provides a theoretical framework that is both significant and illuminating, promising to have a major impact on the field of program optimization. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,58
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book explores an efficient algorithm for planning the motion of a convex polygonal object in a 2-dimensional polygonal space. The algorithm extends and combines techniques developed for the case in which the object is a line segment. It uses results on the planning of translation…al motion of the object amidst polygonal obstacles and a recent result on the number of free critical contacts of the object with such obstacles. The algorithm runs in time O(kn log kn), where k is the number of sides of the object, n is the number of obstacle edges, and x(q) is an almost linear function yielding the maximal number of connected portions of q continuous functions which compose the graph of their lower envelope, where it is assumed that each pair of these functions intersect in at most s points. 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.
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,67
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book delves into the history and conceptual foundations of a highly influential diagram for computational geometry. Generalized Voronoi diagrams have proven particularly valuable for path planning and motion planning applications, and the author meticulously chronicles their deve…lopment from inception to contemporary capabilities. The book is rich in detail and its historical context provides valuable insights into the evolution of these diagrams within the broader field. The author successfully captures the theoretical depth and practical significance of this subject, demonstrating through clear explanations and examples the power of generalized Voronoi diagrams to simplify complex computational challenges. This book is a must-read for anyone seeking a comprehensive understanding of these diagrams and their impact on computer science. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,85
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book investigates Davenport-Schinzel sequences, a subject of combinatorial and computational geometry, to provide optimal bounds for the maximal length of general sequences. In doing so, the author generalizes the techniques employed in establishing bounds for 4-element sequences… to sequences of higher order. Additionally, the book extends and refines results concerning a class of Davenport-Schinzel sequences developed by the author in previous work. Going beyond the bounds established by previous research, the author presents sharp upper and lower bounds for the length of sequences of order 4. For sequences of higher orders, the author establishes almost tight upper and lower bounds, significantly improving on previously known results, making this a valuable resource for researchers and practitioners alike. 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,97
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book explores the complex topological analysis of a Voronoi complex to plan motions for moving an object in two dimensions while avoiding obstacles, such as a ladder avoiding walls in a room. By analyzing the geometry of the complex, the author identifies Voronoi vertices, where…the ladder is equidistant from three obstacles, and Voronoi edges, where the ladder is equidistant from two obstacles. The analysis reveals that every path in the Voronoi complex can be deformed to a path contained in the one-dimensional skeleton of the complex, which is connected and contains the free boundary of every sheet. This result is significant because it implies that motion planning in the Voronoi complex can be reduced to searching in the skeleton, greatly simplifying the problem. The book provides a comprehensive exploration of the topological properties of the Voronoi complex, demonstrating its potential applications in 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.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 16,71
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book explores the analysis of data flow in computer programs, an important technique that aims to optimize program performance. It presents several algorithms designed for different types of data flow problems, including those that involve iteration and recursion. These algorithm…s are based on the author's research and represent significant improvements over traditional methods. They leverage new techniques, such as interval analysis, to enhance their efficiency. The book also examines the practical aspects of implementing these algorithms in a programming language, such as SETL. The author provides a detailed description of how to apply these algorithms to specific data flow problems in the SETL optimizer, including examples of the generated code. Significant attention is given to interprocedural analysis, which is necessary for optimizing programs that consist of multiple procedures that call each other. The book includes a discussion of the theoretical foundations of interprocedural analysis and presents efficient algorithms that can handle complex call patterns. Overall, this book provides a thorough and accessible guide to data flow analysis techniques, addressing both the theoretical underpinnings and their practical implementation. It is a valuable resource for researchers and practitioners seeking to improve the performance of computer programs. 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.
- Brossura
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 21,84
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. KlappentextThis 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 origina.
- Brossura
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 21,84
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
