2924 search results - page 164 / 585 » Lower Bounds in Distributed Computing |
88
Voted
ICPP
1987
IEEE
15 years 4 months ago
1987
IEEE
Abstract. We address the problem of designing and building efficient custom Vl.Sl-besed processors to do computations on large multi-dimensional lattices. The design tradeoffs for ...
91
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
103
Voted
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
116
Voted
MOBICOM
2009
ACM
15 years 7 months ago
2009
ACM
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...
123
Voted
ICPADS
2006
IEEE
15 years 6 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...