Sciweavers

20294 search results - page 220 / 4059
» Algorithmic Information Theory
Sort
View
FOCS
2007
IEEE
16 years 11 days 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
IMC
2006
ACM
15 years 12 months ago
The need for cross-layer information in access point selection algorithms
The low price of commodity wireless LAN cards and access points (APs) has resulted in the rich proliferation of high density WLANs in enterprise, academic environments, and public ...
Karthikeyan Sundaresan, Konstantina Papagiannaki
TIT
1998
127views more  TIT 1998»
15 years 5 months ago
The Art of Signaling: Fifty Years of Coding Theory
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
A. Robert Calderbank
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
16 years 18 days ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
ICSM
1997
IEEE
15 years 10 months ago
Identifying modules via concept analysis
ÐWe describe a general technique for identifying modules in legacy code. The method is based on concept analysisÐa branch of lattice theory that can be used to identify similarit...
Michael Siff, Thomas W. Reps