Sciweavers

1927 search results - page 53 / 386
» UMDAs for dynamic optimization problems
Sort
View
106
Voted
IEEEINTERACT
2002
IEEE
15 years 5 months ago
Code Cache Management Schemes for Dynamic Optimizers
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
Kim M. Hazelwood, Michael D. Smith
98
Voted
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 6 months ago
Understanding cooperative co-evolutionary dynamics via simple fitness landscapes
Cooperative co-evolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance for such tasks can vary widely from good to disa...
Elena Popovici, Kenneth A. De Jong
WWIC
2005
Springer
197views Communications» more  WWIC 2005»
15 years 6 months ago
Reducing Memory Fragmentation with Performance-Optimized Dynamic Memory Allocators in Network Applications
The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in ...
Stylianos Mamagkakis, Christos Baloukas, David Ati...
ICRA
2010
IEEE
134views Robotics» more  ICRA 2010»
14 years 11 months ago
HRP-2 plays the yoyo: From human to humanoid yoyo playing using optimal control
— Yoyo playing may seem easy for a human, but it is a challenging problem for a humanoid robot. This paper presents an approach to generate yoyo motions for the humanoid robot, H...
Katja Mombaur, Manish N. Sreenivasa
109
Voted
EC
2000
96views ECommerce» more  EC 2000»
15 years 12 days ago
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied ...
David A. van Veldhuizen, Gary B. Lamont