Sciweavers

1227 search results - page 106 / 246
» Approximate Kernel Clustering
Sort
View
LCTRTS
2000
Springer
15 years 1 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
ATAL
2009
Springer
15 years 1 months ago
Improved approximation of interactive dynamic influence diagrams using discriminative model updates
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
Prashant Doshi, Yifeng Zeng
AAMAS
2007
Springer
14 years 10 months ago
Parallel Reinforcement Learning with Linear Function Approximation
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Matthew Grounds, Daniel Kudenko
IDEAL
2010
Springer
14 years 7 months ago
Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...
Malik Magdon-Ismail, Jonathan T. Purnell
ICC
2007
IEEE
113views Communications» more  ICC 2007»
15 years 4 months ago
Load-Balanced Clustering Algorithms for Wireless Sensor Networks
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang