Sciweavers

4432 search results - page 70 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
CCE
2008
15 years 2 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 8 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
ANOR
2008
171views more  ANOR 2008»
15 years 2 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
117
Voted
TASE
2008
IEEE
15 years 2 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
15 years 3 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...