10106 search results - page 1610 / 2022 » Algorithm Selection and Scheduling |
178
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
277
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
200
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
188
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
168
click to vote
ICML
1997
IEEE
16 years 7 months ago
1997
IEEE
In recent years there has been a flurry of works on learning probabilistic belief networks. Current state of the art methods have been shown to be successful for two learning scen...