1258 search results - page 65 / 252 » Architecture-driven Problem Decomposition |
MOBIHOC
2010
ACM
13 years 7 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
PAMI
2011
13 years 1 days ago
2011
—3D object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail ...
ICPP
1993
IEEE
14 years 1 months ago
1993
IEEE
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...
FATES
2006
Springer
14 years 26 days ago
2006
Springer
To efficiently solve safety verification and testing problems for an aspect-oriented system, we use multitape automata to model aspects and propose algorithms for the aspect-orient...
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
We present a novel technique for automated problem decomposition to address the problem of scalability in reinforcement learning. Our technique makes use of a set of near-optimal ...