Sciweavers

821 search results - page 62 / 165
» Addressing the Petersen graph
Sort
View
ATAL
2008
Springer
15 years 1 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...
ISCAPDCS
2007
15 years 1 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
SDM
2008
SIAM
114views Data Mining» more  SDM 2008»
15 years 1 months ago
Semi-Supervised Classification with Universum
The Universum data, defined as a collection of "nonexamples" that do not belong to any class of interest, have been shown to encode some prior knowledge by representing ...
Dan Zhang, Jingdong Wang, Fei Wang, Changshui Zhan...
DAGSTUHL
2006
15 years 1 months ago
Rule-based Model Extraction from Source Code
Abstract. In the context of an approach for reengineering legacy software systems at the architectural level, we present in this paper a reverse engineering methodology that uses a...
Rui Correia, Carlos M. P. Matos, Mohammad El-Ramly...
EOR
2007
158views more  EOR 2007»
14 years 11 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...