Sciweavers

2766 search results - page 305 / 554
» Algorithms for trigonometric polynomials
Sort
View
AIPS
2006
15 years 6 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir
115
Voted
AAAI
1998
15 years 6 months ago
An Algebra for Cyclic Ordering of 2D Orientations
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
Amar Isli, Anthony G. Cohn
SODA
1990
ACM
49views Algorithms» more  SODA 1990»
15 years 6 months ago
Factor Refinement
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
Eric Bach, James R. Driscoll, Jeffrey Shallit
151
Voted
AAECC
2010
Springer
132views Algorithms» more  AAECC 2010»
15 years 5 months ago
On the geometry of polar varieties
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...
Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey ...
CORR
2010
Springer
77views Education» more  CORR 2010»
15 years 5 months ago
Triangular Decomposition of Semi-algebraic Systems
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
Changbo Chen, James H. Davenport, John P. May, Mar...