Sciweavers

3229 search results - page 401 / 646
» Mixing
Sort
View
IOR
2007
106views more  IOR 2007»
15 years 6 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
BIOINFORMATICS
2005
151views more  BIOINFORMATICS 2005»
15 years 6 months ago
Differential and trajectory methods for time course gene expression data
Motivation: The issue of high dimensionality in microarray data has been, and remains, a hot topic in statistical and computational analysis. Efficient gene filtering and differen...
Yulan Liang, Bamidele Tayo, Xueya Cai, Arpad Kelem...
CCE
2005
15 years 6 months ago
Wastewater minimisation using central reusable water storage in batch plants
This paper presents a continuous-time mathematical formulation for freshwater and wastewater minimisation in multipurpose batch plants with and without a central reusable water st...
Thokozani Majozi
CORR
2002
Springer
96views Education» more  CORR 2002»
15 years 6 months ago
The Sketch of a Polymorphic Symphony
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
Ralf Lämmel
RSA
2000
170views more  RSA 2000»
15 years 6 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski