Sciweavers

908 search results - page 104 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
131
Voted
AI
2000
Springer
15 years 3 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
FLAIRS
2003
15 years 5 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
124
Voted
GECCO
2005
Springer
145views Optimization» more  GECCO 2005»
15 years 9 months ago
Three dimensional evolutionary aerodynamic design optimization with CMA-ES
In this paper, we present the application of evolutionary optimization methods to a demanding, industrially relevant engineering domain, the three-dimensional optimization of gas ...
Martina Hasenjäger, Bernhard Sendhoff, Toyota...
ICASSP
2011
IEEE
14 years 7 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
142
Voted
CODES
2003
IEEE
15 years 8 months ago
Design optimization of mixed time/event-triggered distributed embedded systems
Distributed embedded systems implemented with mixed, eventtriggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases...
Traian Pop, Petru Eles, Zebo Peng