Sciweavers

1326 search results - page 173 / 266
» Approximate Tree Kernels
Sort
View
ECML
2007
Springer
16 years 14 days ago
Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...
Jan Ramon, Kurt Driessens, Tom Croonenborghs
IPPS
2003
IEEE
15 years 11 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
DATE
2002
IEEE
104views Hardware» more  DATE 2002»
15 years 11 months ago
Closed-Form Crosstalk Noise Metrics for Physical Design Applications
In this paper we present efficient closed-form formulas to estimate capacitive coupling-induced crosstalk noise for distributed RC coupling trees. The efficiency of our approach...
Lauren Hui Chen, Malgorzata Marek-Sadowska
CDC
2008
IEEE
110views Control Systems» more  CDC 2008»
15 years 8 months ago
Topological identification in networks of dynamical systems
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
Donatello Materassi, Giacomo Innocenti
CATS
2007
15 years 7 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...