Chee keng yap (64 resultados)

Condición: New.

Condición: New.

Hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condición: Fine. 511 pp., hardcover, some roughness to the top edge of the first 20 or so pages due to a printing error else near fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Condición: New.

Hardcover. Condición: Fine. 1st Edition. First Edition. 9.5 x 7.75 in. xv, 511 pp. Glossy illustrated boards. No internal markings, faint shelf-wear. Near Fine.

Hardcover. Condición: Very Good. Used like new. White glazed boards. ; 9.6 X 7.9 X 1.4 inches; 528 pages.

Hardcover. Condición: New. 1st Edition. 504 pages. new.

Hardcover. Condición: Very Fine. First Edition. No markings.

hardcover. Condición: New.

Condición: As New. Unread book in perfect condition.

Hardcover. First edition. New/No Jacket (21681) First edition. No jacket, as issued. New book from publisher, NOT a remainder. Clean, tight, unmarked, unused. .

Condición: New.

Condición: New. pp. 321.

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. …

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 investigates a family of polynomial sequences known as polynomial remainder sequences. The concept of a polynomial remainder sequence is rooted in ancient mathematics and has applications in diverse fields like elimination theory, Diophantine equations, and algebraic cell decomposition. The author explores the theoretical underpinnings of these sequences and introduces a new algorithm for computing them. The book also presents a detailed examination of the theory of subresultants, which are intimately connected with polynomial remainder sequences and provide important insights into their structure and behavior. Through this exploration, the author unveils the intricate relationship between subresultants and the Euclidean polynomial remainder sequence, offering a deeper understanding of these fundamental mathematical constructs. 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 develops an algorithm for planning the motion of a rod-shaped object within a two-dimensional space containing obstacles bounded by simple, closed polygons. While previous approaches to motion planning assumed the planning algorithm had an explicit description of the scene as input, the author develops an algorithm that does not require this. Instead, it only requires the algorithm to be able to obtain information about obstacles by detecting points of contact with the obstacles. The computational complexity of the algorithm is O(n^2), which is optimal for the general motion planning problem. The book thus advances the field of motion planning and will be of interest to researchers working in robotics and other areas that require autonomous motion. 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.

Condición: New. pp. 321.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Paperback / softback. Condición: New. New copy - Usually dispatched within 4 working days.

Condición: New. pp. 321.

Paperback. Condición: New.

Condición: New.

Condición: New. In English.

Gebunden. Condición: New.