1195 search results - page 205 / 239 » Modeling an Algebraic Stepper |
114
click to vote
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
108
click to vote
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
149
click to vote
LICS
1998
IEEE
15 years 5 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
102
click to vote
AIPS
2008
15 years 4 months ago
2008
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...
115
click to vote
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...