Results 1  10
of
3,338
Worstcase equilibria
 IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract

Cited by 847 (17 self)
 Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a
Cooperative diversity in wireless networks: efficient protocols and outage behavior
 IEEE TRANS. INFORM. THEORY
, 2004
"... We develop and analyze lowcomplexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies ..."
Abstract

Cited by 2009 (31 self)
 Add to MetaCart
the destination terminal. We develop performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading, focusing on the high signaltonoise ratio (SNR) regime. Except for fixed decodeandforward, all of our cooperative diversity
Optimum ratio of electrontohole mobility in P3HT:PCBM organic solar cells
"... Abstract—We investigate the influence of different electrontohole mobility ratios on the performance of a P3HT:PCBM bulk heterojunction organic solar cell by numerical simulations. We show that using a ratio between electron and hole mobility higher than one, in some particular mobility cases, it ..."
Abstract
 Add to MetaCart
Abstract—We investigate the influence of different electrontohole mobility ratios on the performance of a P3HT:PCBM bulk heterojunction organic solar cell by numerical simulations. We show that using a ratio between electron and hole mobility higher than one, in some particular mobility cases
Optimum Combining in Digital Mobile Radio with Cochannel Interference
 IEEE JSAC
, 1984
"... AbstractThis paper studies optimum signal combining for space diversity reception in cellular mobile radio systems. With optimum combining, the signals received by the antennas are weighted and combined to maximize the output signaltointerferenceplusnoise ratio. Thus, with cochanne1 interfe ..."
Abstract

Cited by 200 (3 self)
 Add to MetaCart
AbstractThis paper studies optimum signal combining for space diversity reception in cellular mobile radio systems. With optimum combining, the signals received by the antennas are weighted and combined to maximize the output signaltointerferenceplusnoise ratio. Thus, with cochanne1
The price of stability for network design with fair cost allocation
 In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS
, 2004
"... Abstract. Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of selfinterested agents who want to form a network connecting certain endpoints, the set of stable solutions — the Nash equilibria — may look quite differ ..."
Abstract

Cited by 281 (30 self)
 Add to MetaCart
different from the centrally enforced optimum. We study the quality of the best Nash equilibrium, and refer to the ratio of its cost to the optimum network cost as the price of stability. The best Nash equilibrium solution has a natural meaning of stability in this context — it is the optimal solution
APPROXIMATION ALGORITHMS FOR SCHEDULING UNRELATED PARALLEL MACHINES
, 1990
"... We consider the following scheduling problem. There are m parallel machines and n independent.jobs. Each job is to be assigned to one of the machines. The processing of.job j on machine i requires time Pip The objective is to lind a schedule that minimizes the makespan. Our main result is a polynomi ..."
Abstract

Cited by 265 (7 self)
 Add to MetaCart
polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer
Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems
, 1999
"... ..."
Approximate Graph Coloring by Semidefinite Programming.
 In Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science,
, 1994
"... Abstract. We consider the problem of coloring kcolorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3colorable graph on n vertices with min{O(⌬ 1/3 log 1/2 ⌬ log n), O(n 1/4 log 1/2 n)} colors where ⌬ is the maximum degree of any vertex ..."
Abstract

Cited by 210 (7 self)
 Add to MetaCart
vertex. Besides giving the best known approximation ratio in terms of n, this marks the first nontrivial approximation result as a function of the maximum degree ⌬. This result can be generalized to kcolorable graphs to obtain a coloring using min{O(⌬ 1Ϫ2/k log 1/2 ⌬ log n), O(n 1Ϫ3/(kϩ1) log 1/2 n
Optimum frame synchronization
 IEEE trans. comm
, 1972
"... AbstractThis paper considers the optimum method for locating a sync word periodically imbedded in binary data and received over the additive white Gaussian noise channel. It is shown that the optimum rule is to select the location that maximizes the sum of the correlation and a correction term. Sim ..."
Abstract

Cited by 51 (0 self)
 Add to MetaCart
AbstractThis paper considers the optimum method for locating a sync word periodically imbedded in binary data and received over the additive white Gaussian noise channel. It is shown that the optimum rule is to select the location that maximizes the sum of the correlation and a correction term
Optimum sampling distances in the Gabor scheme
"... The windowed Fourier transform of a time signal is considered, as well as a way to reconstruct the signal from a sufficiently densely sampled version of its windowed Fourier transform using a Gabor representation; following Gabor, sampling occurs on a twodimensional timefrequency lattice with equi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to the analysis window (which is used in the windowed Fourier transform). It is shown that the resemblance can already be reached for a rather small degree of oversampling, if the sampling distances in the time and frequency directions are properly chosen. A procedure is presented with which the optimum ratio
Results 1  10
of
3,338