1563 search results - page 165 / 313 » Performance comparison of memetic algorithms |
122
Voted
CIAC
1997
Springer
15 years 7 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
107
Voted
MVA
2007
15 years 5 months ago
2007
The problem of planning the Next Best View (NBV) still poses many questions. However, the achieved methods and algorithms are hard to compare, since researchers use their own test...
129
Voted
ESANN
2006
15 years 5 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
99
Voted
UAI
2001
15 years 5 months ago
2001
We present a new method for estimating the expected return of a POMDP from experience. The estimator does not assume any knowledge of the POMDP, can estimate the returns for finit...
112
Voted
TSP
2010
14 years 10 months ago
2010
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...