674 search results - page 81 / 135 » The computational complexity of the parallel knock-out probl... |
105
click to vote
ICPP
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
109
click to vote
SC
2000
ACM
15 years 5 months ago
2000
ACM
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
111
click to vote
ACSD
2007
IEEE
15 years 7 months ago
2007
IEEE
Modern multiprocessor embedded systems execute a large number of tasks on shared processors and handle their complex communications on shared communication networks. Traditional m...
STOC
2001
ACM
16 years 1 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
102
click to vote
NOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...