4255 search results - page 474 / 851 » On Learning Boolean Functions |
179
click to vote
AIPS
2006
15 years 8 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
159
Voted
CATE
2004
15 years 8 months ago
2004
Experience from the management of distributed computer-based learning resources in schools has been proven to be inefficient and costly. Though commercial software packages are av...
203
click to vote
NIPS
2001
15 years 8 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
203
click to vote
NIPS
2001
15 years 8 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
155
click to vote
NIPS
2003
15 years 8 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...