Sciweavers

201 search results - page 25 / 41
» Incremental Algorithms for Approximate Compilation
Sort
View
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
15 years 4 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber
OOPSLA
2004
Springer
15 years 3 months ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
ECML
2007
Springer
15 years 3 months 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
CC
2003
Springer
114views System Software» more  CC 2003»
15 years 2 months ago
Combined Code Motion and Register Allocation Using the Value State Dependence Graph
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...
Neil Johnson, Alan Mycroft
CP
2006
Springer
15 years 1 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa