Sciweavers

920 search results - page 83 / 184
» Generating Satisfiable Problem Instances
Sort
View
DAC
2002
ACM
16 years 1 months ago
ILP-based engineering change
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...
Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng...
116
Voted
WWW
2007
ACM
16 years 1 months ago
A scalable application placement controller for enterprise data centers
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
Chunqiang Tang, Malgorzata Steinder, Mike Spreitze...
SIAMJO
2002
124views more  SIAMJO 2002»
15 years 9 days ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
106
Voted
FOSSACS
2003
Springer
15 years 5 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
108
Voted
EVOW
2006
Springer
15 years 4 months ago
The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
Peter I. Cowling, Nic Colledge, Keshav P. Dahal, S...