Sciweavers

815 search results - page 49 / 163
» Optimizing diversity
Sort
View
CEC
2009
IEEE
15 years 6 months ago
Evolutionary programming with ensemble of explicit memories for dynamic optimization
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
Ling Yu, Ponnuthurai N. Suganthan
CEC
2007
IEEE
15 years 6 months ago
Plateaus can be harder in multi-objective optimization
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
ICMCS
2007
IEEE
194views Multimedia» more  ICMCS 2007»
15 years 6 months ago
Automatically Tuning Background Subtraction Parameters using Particle Swarm Optimization
A common trait of background subtraction algorithms is that they have learning rates, thresholds, and initial values that are hand-tuned for a scenario in order to produce the des...
Brandyn White, Mubarak Shah
VTC
2007
IEEE
146views Communications» more  VTC 2007»
15 years 6 months ago
Orthogonal STBC in General Nakagami-m Fading Channels: BER Analysis and Optimal Power Allocation
Abstract— We analyze the performance of multiple-input multiple-output (MIMO) systems employing orthogonal space-time block codes (STBC) in general Nakagami-m fading channels wit...
Andreas Müller, Joachim Speidel
ECML
2007
Springer
15 years 6 months ago
Optimizing Feature Sets for Structured Data
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
Ulrich Rückert, Stefan Kramer