Sciweavers

1391 search results - page 159 / 279
» Complexity Limitations on Quantum Computation
Sort
View
DAGSTUHL
2001
13 years 9 months ago
Decision-Theoretic Control of Planetary Rovers
Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such res...
Shlomo Zilberstein, Richard Washington, Daniel S. ...
FSTTCS
2010
Springer
13 years 6 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
SIGGRAPH
1998
ACM
14 years 9 days ago
Subdivision Surfaces in Character Animation
The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shap...
Tony DeRose, Michael Kass, Tien Truong
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
14 years 8 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
ISCA
2007
IEEE
146views Hardware» more  ISCA 2007»
14 years 2 months ago
Hardware atomicity for reliable software speculation
Speculative compiler optimizations are effective in improving both single-thread performance and reducing power consumption, but their implementation introduces significant compl...
Naveen Neelakantam, Ravi Rajwar, Suresh Srinivas, ...