Sciweavers

151 search results - page 14 / 31
» Optimized Approximation Algorithm in Neural Networks Without...
Sort
View
115
Voted
IWANN
1999
Springer
15 years 6 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
ICASSP
2009
IEEE
15 years 8 months ago
Cross-layer optimization of wireless fading ad-hoc networks
This paper introduces an algorithm to approximately find optimal wireless networks in presence of fading. Joint optimization of application level rates, routes, link capacities, ...
Nikolaos Gatsis, Alejandro Ribeiro, Georgios B. Gi...
ICANN
2005
Springer
15 years 7 months ago
Informational Energy Kernel for LVQ
We describe a kernel method which uses the maximization of Onicescu’s informational energy as a criteria for computing the relevances of input features. This adaptive relevance d...
Angel Cataron, Razvan Andonie
ML
1998
ACM
153views Machine Learning» more  ML 1998»
15 years 1 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 3 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...