424 search results - page 35 / 85 » Boosted sampling: approximation algorithms for stochastic op... |
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
126
click to vote
AAAI
2010
15 years 4 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
103
click to vote
EMO
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Multi-objective evolutionary algorithms (MOEAs) have proven to be a powerful tool for global optimization purposes of deterministic problem functions. Yet, in many real-w...
122
click to vote
WSC
2008
15 years 5 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
161
Voted
ILP
2004
Springer
15 years 8 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...