2924 search results - page 498 / 585 » Lower Bounds in Distributed Computing |
137
click to vote
HIPC
2003
Springer
15 years 9 months ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
126
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
135
click to vote
COR
2006
15 years 4 months ago
2006
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
150
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
142
click to vote
MICRO
2006
IEEE
15 years 4 months ago
2006
IEEE
We examine the ability of CMPs, due to their lower onchip communication latencies, to exploit data parallelism at inner-loop granularities similar to that commonly targeted by vec...