Sciweavers

2740 search results - page 291 / 548
» Approximating Component Selection
Sort
View
EOR
2002
125views more  EOR 2002»
15 years 3 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
AI
1998
Springer
15 years 3 months ago
Uncertainty Measures of Rough Set Prediction
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. ...
Ivo Düntsch, Günther Gediga
ML
1998
ACM
153views Machine Learning» more  ML 1998»
15 years 3 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
NN
1998
Springer
156views Neural Networks» more  NN 1998»
15 years 3 months ago
Automatic early stopping using cross validation: quantifying the criteria
Cross validation can be used to detect when over tting starts during supervised training of a neural network; training is then stopped before convergence to avoid the overtting  ...
Lutz Prechelt
NN
2002
Springer
224views Neural Networks» more  NN 2002»
15 years 3 months ago
Optimal design of regularization term and regularization parameter by subspace information criterion
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
Masashi Sugiyama, Hidemitsu Ogawa