Sciweavers

2925 search results - page 55 / 585
» Information Complexity of Online Problems
Sort
View
172
Voted
ICC
2007
IEEE
141views Communications» more  ICC 2007»
16 years 9 days ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
ATAL
2006
Springer
15 years 9 months ago
Agent interaction in distributed POMDPs and its implications on complexity
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
Jiaying Shen, Raphen Becker, Victor R. Lesser
EDBT
2008
ACM
131views Database» more  EDBT 2008»
16 years 6 months ago
A Bayesian approach for on-line max and min auditing
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have alr...
Gerardo Canfora, Bice Cavallo
CDC
2009
IEEE
119views Control Systems» more  CDC 2009»
15 years 10 months ago
On-line adaptive optimal timing control of switched systems
Abstract— In this paper we consider the problem of optimizing over the switching times for a multi-modal dynamic system when the complete cost-to-go is not available. The instant...
Xu Chu Ding, Yorai Wardi, Magnus Egerstedt
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 12 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum