1058 search results - page 184 / 212 » It's Doomed; We Can Prove It |
156
click to vote
GLOBECOM
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract—With the proliferation of wireless multimedia applications, multicast/broadcast has been recognized as an efficient technique to transmit a large volume of data to mult...
200
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
171
click to vote
RTSS
1998
IEEE
15 years 10 months ago
1998
IEEE
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
150
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
173
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...