476 search results - page 4 / 96 » Learning When to Use Lazy Learning in Constraint Solving |
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
ICML
2000
IEEE
14 years 6 months ago
2000
IEEE
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
COLT
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
FLAIRS
2006
13 years 7 months ago
2006
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...