1041 search results - page 36 / 209 » Randomizing Reductions of Search Problems |
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Hypervolume based multiobjective evolutionary algorithms (MOEA) nowadays seem to be the first choice when handling multiobjective optimization problems with many, i.e., at lea...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
WEWORC
2007
13 years 9 months ago
2007
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
TIT
2008
13 years 7 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...