Sciweavers

187 search results - page 10 / 38
» Benchmarking and solving dynamic constrained problems
Sort
View
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
ANOR
2008
171views more  ANOR 2008»
14 years 9 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
DFT
2003
IEEE
113views VLSI» more  DFT 2003»
15 years 2 months ago
Buffer and Controller Minimisation for Time-Constrained Testing of System-On-Chip
Test scheduling and Test Access Mechanism (TAM) design are two important tasks in the development of a System-on-Chip (SOC) test solution. Previous test scheduling techniques assu...
Anders Larsson, Erik Larsson, Petru Eles, Zebo Pen...
ECAI
2006
Springer
15 years 1 months ago
Time Constrained VRP: An Agent Environment-Perception Model
In this paper, we present a multiagent model in which agents have a perception upon their shared environment, a measure is associated to the agents' perception field. We apply...
Mahdi Zargayouna
78
Voted
CEC
2010
IEEE
14 years 10 months ago
Elitist Artificial Bee Colony for constrained real-parameter optimization
Abstract-- A novel algorithm to solve constrained realparameter optimization problems, based on the Artificial Bee Colony algorithm is introduced in this paper. The operators used ...
Efrén Mezura-Montes, Ramiro Ernesto Velez-K...