1215 search results - page 52 / 243 » Application domain study of evolutionary algorithms in optim... |
AMC
2007
13 years 9 months ago
2007
In this contribution instances of a problem introduced by the differential cryptanalysis of Feistel cryptosystems are formulated as optimization tasks. The performance of Evoluti...
IICAI
2003
13 years 10 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
AAIM
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
AIPS
2010
13 years 9 months ago
2010
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
EMO
2006
Springer
14 years 17 days ago
2006
Springer
With the popularity of efficient multi-objective evolutionary optimization (EMO) techniques and the need for such problem-solving activities in practice, EMO methodologies and EMO ...