Sciweavers

1277 search results - page 120 / 256
» Terminating Decision Algorithms Optimally
Sort
View
172
Voted
TCOM
2010
197views more  TCOM 2010»
15 years 1 months ago
Power control for cooperative dynamic spectrum access networks with diverse QoS constraints
Dynamic spectrum access (DSA) is an integral part of cognitive radio technology aiming at efficient management of the available power and bandwidth resources. The present paper d...
Nikolaos Gatsis, Antonio G. Marqués, Georgi...
FOCS
2007
IEEE
15 years 9 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala
135
Voted
IPSN
2003
Springer
15 years 8 months ago
A Distributed Algorithm for Waking-up in Heterogeneous Sensor Networks
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
Akis Spyropoulos, Cauligi S. Raghavendra, Viktor K...
141
Voted
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 5 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ICML
2009
IEEE
16 years 4 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri