Sciweavers

3367 search results - page 150 / 674
» Incremental assignment problem
Sort
View
CEC
2009
IEEE
15 years 7 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
COR
2010
164views more  COR 2010»
15 years 3 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
ENDM
2006
69views more  ENDM 2006»
15 years 3 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
97
Voted
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
15 years 9 months ago
On time-scale designs for networks
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
Sandip Roy, Yan Wan, Ali Saberi
AAAI
2008
15 years 5 months ago
Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
James C. Boerkoel Jr., Edmund H. Durfee