1047 search results - page 109 / 210 » Learning the required number of agents for complex tasks |
ESANN
2007
13 years 9 months ago
2007
We apply kernel-based machine learning methods to online learning situations, and look at the related requirement of reducing the complexity of the learnt classifier. Online meth...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
ALT
1999
Springer
14 years 6 days ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
AAAI
2004
13 years 9 months ago
2004
The aim of this paper is to compare Bayesian network classifiers to the k-NN classifier based on a subset of features. This subset is established by means of sequential feature se...