Sciweavers

716 search results - page 42 / 144
» Optimizing Sorting with Machine Learning Algorithms
Sort
View
PVM
2005
Springer
15 years 7 months ago
Some Improvements to a Parallel Decomposition Technique for Training Support Vector Machines
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
Thomas Serafini, Luca Zanni, Gaetano Zanghirati
ICML
2006
IEEE
16 years 2 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
154
Voted
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
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 3 months ago
Evolving sequence patterns for prediction of sub-cellular locations of eukaryotic proteins
A genetic algorithm (GA) is utilised to discover known and novel PROSITE-like sequence templates that can be used to classify the sub-cellular location of eukaryotic proteins. Whi...
Greg Paperin
ICML
2006
IEEE
16 years 2 months ago
Algorithms for portfolio management based on the Newton method
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. S...