Sciweavers

879 search results - page 71 / 176
» A Constraint Programming Approach for the Service Consolidat...
Sort
View
123
Voted
SAC
2004
ACM
15 years 9 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
IPPS
2009
IEEE
15 years 10 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
212
Voted
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 6 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
142
Voted
ICDCS
2003
IEEE
15 years 8 months ago
QoS-Assured Service Composition in Managed Service Overlay Networks
Many value-added and content delivery services are being offered via service level agreements (SLAs). These services can be interconnected to form a service overlay network (SON) ...
Xiaohui Gu, Klara Nahrstedt, Rong N. Chang, Christ...
129
Voted
ANOR
2007
73views more  ANOR 2007»
15 years 3 months ago
A sample-path approach to optimal position liquidation
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
Pavlo A. Krokhmal, Stan Uryasev