Sciweavers

879 search results - page 66 / 176
» A Constraint Programming Approach for the Service Consolidat...
Sort
View
NETWORKS
2008
15 years 16 days ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
APJOR
2010
112views more  APJOR 2010»
15 years 22 days ago
Sample Average Approximation Methods for a Class of Stochastic Variational inequality Problems
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
Huifu Xu
98
Voted
JAIR
2008
98views more  JAIR 2008»
15 years 18 days ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
DAC
2005
ACM
16 years 1 months ago
A quasi-convex optimization approach to parameterized model order reduction
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
123
Voted
EUROSYS
2007
ACM
15 years 9 months ago
Adaptive control of virtualized resources in utility computing environments
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
Pradeep Padala, Kang G. Shin, Xiaoyun Zhu, Mustafa...