Sciweavers

476 search results - page 22 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
73
Voted
WSC
2008
15 years 7 hour ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi
ACML
2009
Springer
15 years 1 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
ICIP
2006
IEEE
15 years 11 months ago
Knowledge-Based Supervised Learning Methods in a Classical Problem of Video Object Tracking
In this paper we present a new scheme for detection and tracking of specific objects in a knowledge-based framework. The scheme uses a supervised learning method: Support Vector M...
Lionel Carminati, Jenny Benois-Pineau, Christian J...
IJCAI
1989
14 years 11 months ago
Constrained Heuristic Search
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
Mark S. Fox, Norman M. Sadeh, Can A. Baykan
CSCLP
2006
Springer
15 years 1 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan