2899 search results - page 167 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
144
Voted
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
135
click to vote
ICMCS
2006
IEEE
16 years 5 days ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
148
click to vote
CPAIOR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
143
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
168
click to vote
CCP
2011
14 years 6 months ago
2011
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...