Sciweavers

724 search results - page 56 / 145
» Discrete Rate Simulation using linear programming
Sort
View
MP
2006
107views more  MP 2006»
13 years 8 months ago
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
TEC
1998
106views more  TEC 1998»
13 years 8 months ago
Combining mutation operators in evolutionary programming
Abstract— Traditional investigations with evolutionary programming (EP) for continuous parameter optimization problems have used a single mutation operator with a parameterized p...
Kumar Chellapilla
ICPADS
2007
IEEE
14 years 3 months ago
Scheduling multiple divisible loads on a linear processor network
Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one...
Matthieu Gallet, Yves Robert, Frédér...
WSC
2008
13 years 11 months ago
Determining an appropriate number of FOUPs in semiconductor wafer fabrication facilities
In this paper, multiple orders per job type formation and release strategies are described for semiconductor wafer fabrication facilities (wafer fabs). Different orders are groupe...
Jens Zimmermann, Scott J. Mason, John W. Fowler, L...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 9 months ago
"Real" Slepian-Wolf Codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg