Sciweavers

17185 search results - page 3382 / 3437
» Computational and Quantitative Studies
Sort
View
TALG
2008
152views more  TALG 2008»
14 years 9 months ago
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...
TASE
2008
IEEE
14 years 9 months ago
Group Elevator Scheduling With Advance Information for Normal and Emergency Modes
Group elevator scheduling has long been recognized as an important problem for building transportation efficiency, since unsatisfactory elevator service is one of the major complai...
Peter B. Luh, Bo Xiong, Shi-Chung Chang
TC
2008
14 years 9 months ago
Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR)
The rapidly increasing energy consumption by computing and communications equipment is a significant economic and environmental problem that needs to be addressed. Ethernet network...
Chamara Gunaratne, Kenneth J. Christensen, Bruce N...
TCS
2008
14 years 9 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
IOR
2007
89views more  IOR 2007»
14 years 9 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
« Prev « First page 3382 / 3437 Last » Next »