4544 search results - page 608 / 909 » Reinforcement Learning with Time |
209
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
210
click to vote
ACMICEC
2008
ACM
15 years 8 months ago
2008
ACM
Supply Chain Management (SCM) involves a number of interrelated activities from negotiating with suppliers to competing for customer orders and scheduling the manufacturing proces...
182
Voted
COLT
2008
Springer
15 years 8 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
176
Voted
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
211
click to vote
AAAI
2012
13 years 9 months ago
2012
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...