278 search results - page 44 / 56 » Quantitative Fairness Games |
SOFSEM
2010
Springer
15 years 7 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
UM
2005
Springer
15 years 3 months ago
2005
Springer
Intelligent tutoring systems help students acquire cognitive skills by tracing students’ knowledge and providing relevant feedback. However, feedback that focuses only on the cog...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
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 ...
103
click to vote
FAST
2009
14 years 8 months ago
2009
Rapid adoption of virtualization technologies has led to increased utilization of physical resources, which are multiplexed among numerous workloads with varying demands and impor...