Sciweavers

2354 search results - page 328 / 471
» Assignment Problems
Sort
View
AI
2006
Springer
15 years 5 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
139
Voted
EOR
2008
78views more  EOR 2008»
15 years 5 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 5 months ago
Crosstalk-free Conjugate Networks for Optical Multicast Switching
High-speed photonic switching networks can switch optical signals at the rate of several terabits per second. However, they suffer from an intrinsic crosstalk problem when two opti...
Yun Deng, Tony T. Lee
141
Voted
IPL
2008
80views more  IPL 2008»
15 years 5 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
164
Voted
IJHIS
2006
94views more  IJHIS 2006»
15 years 5 months ago
A new fine-grained evolutionary algorithm based on cellular learning automata
In this paper, a new evolutionary computing model, called CLA-EC, is proposed. This model is a combination of a model called cellular learning automata (CLA) and the evolutionary ...
Reza Rastegar, Mohammad Reza Meybodi, Arash Hariri