Sciweavers

1941 search results - page 137 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ICRA
2008
IEEE
170views Robotics» more  ICRA 2008»
16 years 26 days ago
Fast grasp planning for hand/arm systems based on convex model
— This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the fricti...
Kensuke Harada, Kenji Kaneko, Fumio Kanehiro
FOCS
2000
IEEE
15 years 11 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
EMO
2006
Springer
158views Optimization» more  EMO 2006»
15 years 10 months ago
The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration
The design of quality measures for approximations of the Pareto-optimal set is of high importance not only for the performance assessment, but also for the construction of multiobj...
Eckart Zitzler, Dimo Brockhoff, Lothar Thiele
UAI
1998
15 years 7 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
PPSC
1997
15 years 7 months ago
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
Alan Edelman, Peter McCorquodale, Sivan Toledo