منابع مشابه
The Algebraic Complexity of Shortest Paths in Polyhedral Spaces
In this paper we show that the problem of finding the shortest path between two points in Euclidean 3-space, bounded by a finite collection of polyhedral obstacles, is in general not solvable by radicals over the field of rationals. The problem is shown to be not solvable even for the case when only two obstacle edges are encountered in the shof[est path in 3-space. One direct consequence of th...
متن کاملAlgebraic distance in algebraic cone metric spaces and its properties
In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.
متن کاملAn Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexity, restricted to verifying only the control behavior. The circuit is modeled at the arithmetic bit level (ABL) so that our approach is well adapted to current industrial design styles for high performance data paths....
متن کاملFollowing the paths of XML Data: An algebraic framework for XML query evaluation
This paper introduces an algebraic framework for expressing and evaluating queries over XML data. It presents the underlying assumptions of the framework, describes the input and output of the algebraic operators, and defines these operators and their semantics. It evaluates the framework with regard to other proposed XML query algebras. Examples show that this framework is flexible enough to c...
متن کاملAn algebraic method to check the singularity-free paths for parallel robots
Trajectory planning is a critical step while programming the parallel manipulators in a robotic cell. The main problem arises when there exists a singular configuration between the two poses of the end-effectors while discretizing the path with a classical approach. This paper presents an algebraic method to check the feasibility of any given trajectories in the workspace. The solutions of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1968
ISSN: 0021-8693
DOI: 10.1016/0021-8693(68)90102-6