Sciweavers

2740 search results - page 131 / 548
» Approximating Component Selection
Sort
View
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
15 years 9 months ago
Convergence rate for stochastic consensus algorithms with time-varying noise statistics: Asymptotic normality
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
Minyi Huang
ICML
2009
IEEE
16 years 3 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
AI
2006
Springer
15 years 6 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar
ICML
1994
IEEE
15 years 6 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
ICC
2007
IEEE
186views Communications» more  ICC 2007»
15 years 4 months ago
On Channel Coding Selection in Time-Slotted ALOHA Packetized Multiple-Access Systems Over Rayleigh Fading Channels
— In this paper, we consider the time-slotted ALOHA packetized multiple-access system where the transmission channels obey i.i.d (independent identically distributed) Rayleigh fa...
Chen Wei, Pingyi Fan, Khaled Ben Letaief