Sciweavers

3049 search results - page 609 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 5 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
MST
2000
57views more  MST 2000»
13 years 5 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
TVLSI
2002
97views more  TVLSI 2002»
13 years 5 months ago
Techniques for energy-efficient communication pipeline design
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...
Gang Qu, Miodrag Potkonjak
INFOCOM
2010
IEEE
13 years 3 months ago
Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de...
TMC
2010
138views more  TMC 2010»
13 years 3 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu