Sciweavers

1272 search results - page 166 / 255
» The Set Cover with Pairs Problem
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Cross-domain transfer for reinforcement learning
A typical goal for transfer learning algorithms is to utilize knowledge gained in a source task to learn a target task faster. Recently introduced transfer methods in reinforcemen...
Matthew E. Taylor, Peter Stone
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 5 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
AIED
2007
Springer
14 years 4 months ago
Helping Courseware Authors to Build Ontologies: The Case of TM4L
The authors of topic map-based learning resources face major difficulties in constructing the underlying ontologies. In this paper we propose two approaches to address this problem...
Darina Dicheva, Christo Dichev
ECML
2007
Springer
14 years 4 months ago
Discriminative Sequence Labeling by Z-Score Optimization
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
Elisa Ricci, Tijl De Bie, Nello Cristianini
DNA
2005
Springer
14 years 3 months ago
Two Proteins for the Price of One: The Design of Maximally Compressed Coding Sequences
Abstract. The emerging field of synthetic biology moves beyond conventional genetic manipulation to construct novel life forms which do not originate in nature. We explore the pro...
Bei Wang, Dimitris Papamichail, Steffen Mueller, S...