1174 search results - page 102 / 235 » Optimizing generics is easy! |
EMO
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
BMVC
2001
14 years 14 days ago
2001
This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...
EMO
2006
Springer
14 years 1 days ago
2006
Springer
Multi-objective metaheuristics have previously been applied to partial classification, where the objective is to produce simple, easy to understand rules that describe subsets of a...
EC
2007
13 years 10 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
PE
2002
Springer
13 years 9 months ago
2002
Springer
In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the...