Sciweavers

110 search results - page 16 / 22
» New Upper Bounds for Maximum Satisfiability
Sort
View
HM
2010
Springer
146views Optimization» more  HM 2010»
14 years 9 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
80
Voted
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
15 years 1 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
73
Voted
AHSWN
2008
92views more  AHSWN 2008»
14 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
89
Voted
SPAA
2005
ACM
15 years 3 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
DAC
2006
ACM
15 years 10 months ago
Timing driven power gating
Power Gating is effective for reducing leakage power. Previously, a Distributed Sleep Transistor Network (DSTN) was proposed to reduce the sleep transistor area by connecting all ...
De-Shiuan Chiou, Shih-Hsin Chen, Shih-Chieh Chang,...