403 search results - page 34 / 81 » Sampling Bounds for Stochastic Optimization |
UAI
2004
13 years 11 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
UAI
2004
13 years 11 months ago
2004
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
TON
2010
13 years 8 months ago
2010
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
NIPS
1998
13 years 11 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
SIGECOM
2011
ACM
13 years 21 days ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...