674 search results - page 22 / 135 » The computational complexity of the parallel knock-out probl... |
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
Coupled systems comprise multiple interacting subsystems and are an increasingly common computational science application, most notably as multiscale and multiphysics models. Paral...
HPCN
1995
Springer
14 years 1 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
EUROPAR
2011
Springer
12 years 9 months ago
2011
Springer
DOALL loops are tiled to exploit DOALL parallelism and data locality on GPUs. In contrast, due to loop-carried dependences, DOACROSS loops must be skewed first in order to make ti...
PODC
2006
ACM
14 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...