Sciweavers

350 search results - page 60 / 70
» Approximation Algorithms for Unique Games
Sort
View
WINE
2005
Springer
146views Economy» more  WINE 2005»
14 years 29 days ago
A Cost Mechanism for Fair Pricing of Resource Usage
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
Marios Mavronicolas, Panagiota N. Panagopoulou, Pa...
JSAC
2006
124views more  JSAC 2006»
13 years 7 months ago
A game-theoretic approach to energy-efficient power control in multicarrier CDMA systems
A game-theoretic model for studying power control in multicarrier code-division multiple-access systems is proposed. Power control is modeled as a noncooperative game in which each...
Farhad Meshkati, Mung Chiang, H. Vincent Poor, Stu...
ICML
2008
IEEE
14 years 8 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 7 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi