Sciweavers

4208 search results - page 461 / 842
» Better Selection of the Best
Sort
View
IWANN
1999
Springer
15 years 11 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
BMCBI
2010
152views more  BMCBI 2010»
15 years 7 months ago
Comparative study of discretization methods of microarray data for inferring transcriptional regulatory networks
Background: Microarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are us...
Yong Li, Lili Liu, Xi Bai, Hua Cai, Wei Ji, Dianji...
287
Voted

Publication
200views
17 years 5 months ago
Dynamic Queue Control Functions for ATM ABR Switch Schemes: Design and Analysis
The main goals of a switch scheme are high utilization, low queuing delay and fairness. To achieve high utilization the switch scheme can maintain non-zero (small) queues in steady...
Bobby Vandalore, Raj Jain, Rohit Goyal, Sonia Fahm...
CVPR
2001
IEEE
16 years 8 months ago
Bayesian Learning of Sparse Classifiers
Bayesian approaches to supervised learning use priors on the classifier parameters. However, few priors aim at achieving "sparse" classifiers, where irrelevant/redundant...
Anil K. Jain, Mário A. T. Figueiredo
CVPR
2006
IEEE
16 years 8 months ago
Perception Strategies in Hierarchical Vision Systems
Flat appearance-based systems, which combine clever image representations with standard classifiers, might be the most effective way to recognize objects using current technologie...
Lior Wolf, Stanley M. Bileschi, Ethan Meyers