Sciweavers

799 search results - page 19 / 160
» Improving the feasibility pump
Sort
View
CSC
2006
14 years 9 days ago
An Algorithm to Solve a Linear Program
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
Rajan Alex
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 6 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
ICALP
2009
Springer
14 years 5 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
CN
1999
77views more  CN 1999»
13 years 10 months ago
Web Content Adaptation to Improve Server Overload Behavior
This paper presents a study of web content adaptation to improve server overload performance, as well as an implementation of a web content adaptation software prototype. When the...
Tarek F. Abdelzaher, Nina T. Bhatti
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
14 years 5 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....