674 search results - page 54 / 135 » The computational complexity of the parallel knock-out probl... |
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
116
click to vote
CONCUR
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
109
click to vote
PDPTA
2010
14 years 11 months ago
2010
The problem of programmability on modern heterogeneous multicore and future manycore embedded platforms is still not solved satisfactorily: although many existing but incompatible ...
132
click to vote
PROPERTYTESTING
2010
14 years 11 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...