Sciweavers

1800 search results - page 13 / 360
» Learning Restart Strategies
Sort
View
CP
2007
Springer
14 years 1 months ago
Limitations of Restricted Branching in Clause Learning
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
Matti Järvisalo, Tommi A. Junttila
ATAL
2008
Springer
13 years 9 months ago
Transfer of task representation in reinforcement learning using policy-based proto-value functions
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
Eliseo Ferrante, Alessandro Lazaric, Marcello Rest...
NIPS
2004
13 years 9 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
ICDAR
2009
IEEE
14 years 2 months ago
Fast Incremental Learning Strategy Driven by Confusion Reject for Online Handwriting Recognition
In this paper, we present a new incremental learning strategy for handwritten character recognition systems. This learning strategy enables the recognition system to learn “rapi...
Abdullah Almaksour, Éric Anquetil
ICML
1995
IEEE
13 years 11 months ago
Learning Collection FUsion Strategies for Information Retrieval
In this paper we describe an Information Retrieval problem called collection fusion. The collection fusion problem is to maximize the number of relevant natural language documents...
Geoffrey G. Towell, Ellen M. Voorhees, Narendra Ku...