Sciweavers

1529 search results - page 179 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 10 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
DOCENG
2006
ACM
15 years 10 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
SBBD
2008
256views Database» more  SBBD 2008»
15 years 5 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 9 months ago
A new evolutionary method for time series forecasting
This paper presents a new method — the Time-delay Added Evolutionary Forecasting (TAEF) method — for time series prediction which performs an evolutionary search of the minimu...
Tiago A. E. Ferreira, Germano C. Vasconcelos, Paul...
ICML
2000
IEEE
16 years 5 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos