223 search results - page 23 / 45 » Proving Termination by Bounded Increase |
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
INFOCOM
2007
IEEE
14 years 5 months ago
2007
IEEE
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
NIXDORF
1992
14 years 2 months ago
1992
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
CCCG
1998
14 years 5 days ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...