Sciweavers

674 search results - page 63 / 135
» Resource Bound Certification
Sort
View
ML
2002
ACM
121views Machine Learning» more  ML 2002»
14 years 11 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
13 years 2 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns
GLOBECOM
2008
IEEE
15 years 6 months ago
On Channel Estimation and Capacity for Amplify and Forward Relay Networks
—Relay networks have received considerable attention recently, especially when limited size and power resources impose constraints on the number of antennas within a wireless sen...
Alireza Shahan Behbahani, Ahmed M. Eltawil
ECRTS
2006
IEEE
15 years 6 months ago
On a Theory of Media Processing Systems Behavior, with Applications
In this article we provide a model for the dynamic behavior of media processing chains of tasks communicating via bounded buffers. The aim is to find the overall behavior of a cha...
M. A. Weffers-Albu, Johan J. Lukkien, Elisabet F. ...
TCS
2011
14 years 6 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann