5302 search results - page 304 / 1061 » Learning How to Separate |
185
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
196
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
How to assign appropriate weights to terms is one of the critical issues in information retrieval. Many term weighting schemes are unsupervised. They are either based on the empir...
182
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
168
Voted
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
178
click to vote
ICTAI
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...