Sciweavers

8540 search results - page 98 / 1708
» The Dynamic Servers Problem
Sort
View
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 3 months ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
FLAIRS
2006
14 years 11 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
ISLPED
1998
ACM
79views Hardware» more  ISLPED 1998»
15 years 2 months ago
Voltage scheduling problem for dynamically variable voltage processors
This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. A static voltage scheduling problem is also proposed and for...
Tohru Ishihara, Hiroto Yasuura
EVOW
2009
Springer
15 years 4 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 2 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...