Sciweavers

4047 search results - page 637 / 810
» Algebraic Model Checking
Sort
View
166
Voted
AIPS
2008
15 years 8 months ago
Efficient ADD Operations for Point-Based Algorithms
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...
Guy Shani, Pascal Poupart, Ronen I. Brafman, Solom...
COMPGEOM
2005
ACM
15 years 8 months ago
Shortest path amidst disc obstacles is computable
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...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
EGITALY
2006
15 years 7 months ago
Implementing mesh-based approaches for deformable objects on GPU
These latest years witnessed an impressive improvement of graphics hardware both in terms of features and in terms of computational power. This improvement can be easily observed ...
Guido Ranzuglia, Paolo Cignoni, Fabio Ganovelli, R...
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
15 years 7 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...
SMA
2010
ACM
164views Solid Modeling» more  SMA 2010»
15 years 6 months ago
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
Michael Barton, Gershon Elber, Iddo Hanniel