674 search results - page 107 / 135 » The computational complexity of the parallel knock-out probl... |
125
click to vote
DEBS
2008
ACM
15 years 2 months ago
2008
ACM
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
114
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
—The sustained push for performance, transistor count, and instruction level parallelism has reached a point where chip level power density issues are at the forefront of design ...
117
click to vote
IEEEPACT
2008
IEEE
15 years 7 months ago
2008
IEEE
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
APPT
2007
Springer
15 years 7 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
110
click to vote
PODC
2003
ACM
15 years 6 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...