Sciweavers

4816 search results - page 260 / 964
» Performance analysis of the AntNet algorithm
Sort
View
TIT
2002
164views more  TIT 2002»
15 years 6 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
COMPLIFE
2006
Springer
15 years 10 months ago
Set-Oriented Dimension Reduction: Localizing Principal Component Analysis Via Hidden Markov Models
We present a method for simultaneous dimension reduction and metastability analysis of high dimensional time series. The approach is based on the combination of hidden Markov model...
Illia Horenko, Johannes Schmidt-Ehrenberg, Christo...
GECCO
2005
Springer
203views Optimization» more  GECCO 2005»
16 years 4 days ago
Ant colony optimization for power plant maintenance scheduling optimization
In order to maintain a reliable and economic electric power supply, the maintenance of power plants is becoming increasingly important. In this paper, a formulation that enables a...
Wai-Kuan Foong, Holger R. Maier, Angus R. Simpson
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 10 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
MVA
1990
143views Computer Vision» more  MVA 1990»
15 years 7 months ago
Multiresolution Pyramid Architectures for Real-Time Motion Analysis
Multiresolution pyramid techniques can improve the efficiency of basic vision algorithms by orders of magnitude. They will be key to developing practical vision systems to perform...
Peter J. Burt