6437 search results - page 545 / 1288 » Parallel Algorithms for Arrangements |
176
Voted
JCC
2008
15 years 6 months ago
2008
: Quantum Monte Carlo (QMC) calculations require the generation of random electronic configurations with respect to a desired probability density, usually the square of the magnitu...
197
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
178
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
173
click to vote
IPPS
2005
IEEE
16 years 13 days ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
154
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...