4903 search results - page 543 / 981 » The Set Covering Machine |
196
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
179
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
200
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Temporal difference (TD) algorithms are attractive for reinforcement learning due to their ease-of-implementation and use of "bootstrapped" return estimates to make effi...
188
click to vote
ICMLA
2009
15 years 4 months ago
2009
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
194
click to vote
ESWA
2010
15 years 4 months ago
2010
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...