3047 search results - page 209 / 610 » Randomized Parallel Selection |
ASPLOS
2010
ACM
15 years 4 months ago
2010
ACM
Heterogeneous computing combines general purpose CPUs with accelerators to efficiently execute both sequential control-intensive and data-parallel phases of applications. Existin...
100
click to vote
PPSC
1993
15 years 14 days ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
DATE
2003
IEEE
15 years 4 months ago
2003
IEEE
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...
100
click to vote
SCAI
2008
15 years 17 days ago
2008
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We analyze the performance of CDMA signature optimization with finite rate feedback. For a particular user, the receiver selects a signature vector from a signature codebook to avo...