Sciweavers

580 search results - page 61 / 116
» On the Theory of Stochastic Processors
Sort
View
CF
2009
ACM
15 years 2 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 7 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
SPAA
1996
ACM
15 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
TOMACS
2011
139views more  TOMACS 2011»
14 years 4 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
SAGT
2009
Springer
102views Game Theory» more  SAGT 2009»
15 years 4 months ago
Free-Riding and Free-Labor in Combinatorial Agency
Abstract. This paper studies a setting where a principal needs to motivate teams of agents whose efforts lead to an outcome that stochastically depends on the combination of agent...
Moshe Babaioff, Michal Feldman, Noam Nisan