Sciweavers

94 search results - page 13 / 19
» Non-clairvoyant Scheduling Games
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Utility Maximization for Delay Constrained QoS in Wireless
Abstract—This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that ...
I-Hong Hou, P. R. Kumar
129
Voted
ICALP
2011
Springer
14 years 1 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
HICSS
1998
IEEE
94views Biometrics» more  HICSS 1998»
15 years 1 months ago
An Internet-Based Platform for Testing Generation Scheduling Auctions
This paper describes the uses and architecture of a network-centered computing-rich software platform called PowerWeb. PowerWeb was designed and built as a simulation environment ...
Ray Zimmerman, Robert J. Thomas, Deqiang Gan, Carl...
91
Voted
SODA
2007
ACM
115views Algorithms» more  SODA 2007»
14 years 11 months ago
Strong price of anarchy
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...
Nir Andelman, Michal Feldman, Yishay Mansour
CORR
2010
Springer
112views Education» more  CORR 2010»
14 years 9 months ago
Efficient Approximation of Optimal Control for Markov Games
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
Markus Rabe, Sven Schewe, Lijun Zhang