1174 search results - page 102 / 235 » Optimizing generics is easy! |
135
click to vote
EMO
2005
Springer
15 years 8 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...
106
click to vote
BMVC
2001
15 years 5 months 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...
131
click to vote
EMO
2006
Springer
15 years 5 months 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...
170
click to vote
EC
2007
15 years 3 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...
152
click to vote
PE
2002
Springer
15 years 2 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...