1004 search results - page 75 / 201 » Product representations of polynomials |
SARA
2009
Springer
15 years 4 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
PG
2000
IEEE
15 years 2 months ago
2000
IEEE
The representation of moving geometry entities is an important issue in the fields of CAD/CAM and robotics motion design. We present a method to interpolate the moving frame homog...
AAAI
2006
14 years 11 months ago
2006
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
COCO
2010
Springer
14 years 11 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
IMAMS
2007
14 years 11 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...