Sciweavers

53 search results - page 9 / 11
» Approximating the Stochastic Knapsack Problem: The Benefit o...
Sort
View
AAAI
2008
13 years 8 months ago
Perpetual Learning for Non-Cooperative Multiple Agents
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
Luke Dickens
TCOM
2010
133views more  TCOM 2010»
13 years 4 months ago
Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies
Abstract——This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
J. Huang, V. Krishnamurthy
ICPPW
2009
IEEE
14 years 19 days ago
Dynamic Control and Resource Allocation in Wireless-Infrastructured Distributed Cellular Networks with OFDMA
—In this paper, we consider joint optimization of end-to-end data transmission and resource allocation for Wireless-Infrastructured Distributed Cellular Networks (WIDCNs), where ...
Lei You, Ping Wu, Mei Song, Junde Song, Yong Zhang
JMLR
2010
195views more  JMLR 2010»
13 years 4 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
EDBT
2008
ACM
111views Database» more  EDBT 2008»
14 years 6 months ago
On-line discovery of hot motion paths
We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investig...
Dimitris Sacharidis, Kostas Patroumpas, Manolis Te...