Sciweavers

3221 search results - page 487 / 645
» Termination of Linear Programs
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 3 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
IPPS
2009
IEEE
16 years 1 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
IPPS
2009
IEEE
16 years 1 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
UM
2009
Springer
16 years 26 days ago
PerspectiveSpace: Opinion Modeling with Dimensionality Reduction
Abstract. Words mean different things to different people, and capturing these differences is often a subtle art. These differences are often “a matter of perspective,” and...
Jason B. Alonso, Catherine Havasi, Henry Lieberman
APCSAC
2007
IEEE
16 years 21 days ago
Runtime Performance Projection Model for Dynamic Power Management
In this paper, a runtime performance projection model for dynamic power management is proposed. The model is built as a first-order linear equation using a linear regression model....
Sang Jeong Lee, Hae-Kag Lee, Pen-Chung Yew