2899 search results - page 290 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
167
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
196
click to vote
CATA
2004
15 years 8 months ago
2004
Thinning operation is a fundamental operation in image processing. It is a typical preprocessing stage for pattern recognition and data compression. In this report we proposed an ...
172
click to vote
ACTA
1998
15 years 6 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
149
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
– With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and mo...
120
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...