321 search results - page 8 / 65 » Implementing Randomized Matrix Algorithms in Parallel and Di... |
134
click to vote
JPDC
2006
15 years 2 months ago
2006
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
101
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
151
click to vote
SOSP
2009
ACM
15 years 11 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
102
Voted
CLADE
2003
IEEE
15 years 7 months ago
2003
IEEE
The heterogeneity and unpredictability of grid computing environments is a severe challenge to algorithm selection for large-scale scientific codes. This paper discusses a set of ...
103
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
The system of equations that govern kinematically redundant manipulators is commonly solved by nding the singular value decomposition (SVD) of the corresponding Jacobian matrix. T...