3379 search results - page 330 / 676 » Parallel cross-entropy optimization |
126
Voted
PODC
2003
ACM
15 years 9 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
109
Voted
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
Some of the most challenging applications to parallelize scalably are the ones that present a relatively small amount of computation per iteration. Multiple interacting performance...
122
Voted
IEEEPACT
1999
IEEE
15 years 8 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
138
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
123
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...