836 search results - page 126 / 168 » On the Complexity of Train Assignment Problems |
164
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or `unrolling' of a manifold into ...
143
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
138
click to vote
HPDC
2008
IEEE
15 years 10 months ago
2008
IEEE
As grid computation systems become larger and more complex, manually diagnosing failures in jobs becomes impractical. Recently, machine-learning techniques have been proposed to d...
145
click to vote
CRV
2005
IEEE
15 years 9 months ago
2005
IEEE
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
137
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance bet...