118 search results - page 8 / 24 » Using Local Trajectory Optimizers to Speed Up Global Optimiz... |
116
Voted
CF
2010
ACM
15 years 7 months ago
2010
ACM
Over the past decade, the trajectory to the petascale has been built on increased complexity and scale of the underlying parallel architectures. Meanwhile, software developers hav...
119
Voted
IEEEPACT
2006
IEEE
15 years 8 months ago
2006
IEEE
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
127
Voted
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
126
Voted
HIPEAC
2007
Springer
15 years 9 months ago
2007
Springer
Caches are designed to provide the best tradeoff between access speed and capacity for a set of target applications. Unfortunately, different applications, and even different phas...
128
Voted
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 4 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...