Sciweavers

408 search results - page 52 / 82
» On a stochastic sequencing and scheduling problem
Sort
View
WIOPT
2011
IEEE
12 years 11 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely
ICPR
2008
IEEE
14 years 2 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
AAAI
2007
13 years 10 months ago
An Ironing-Based Approach to Adaptive Online Mechanism Design in Single-Valued Domains
Online mechanism design considers the problem of sequential decision making in a multi-agent system with self-interested agents. The agent population is dynamic and each agent has...
David C. Parkes, Quang Duong
CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 7 months ago
Universal Denoising of Discrete-time Continuous-Amplitude Signals
We consider the problem of reconstructing a discrete-time continuous-amplitude signal corrupted by a known memoryless channel with a general output alphabet. We develop a sequence ...
Kamakshi Sivaramakrishnan, Tsachy Weissman
SCHEDULING
2008
97views more  SCHEDULING 2008»
13 years 7 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee