Sciweavers

146 search results - page 26 / 30
» A hybrid constraint programming approach to the log-truck sc...
Sort
View
CP
2004
Springer
15 years 2 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
DFT
2006
IEEE
105views VLSI» more  DFT 2006»
15 years 3 months ago
Thermal-Aware SoC Test Scheduling with Test Set Partitioning and Interleaving
1 High temperature has become a major problem for system-on-chip testing. In order to reduce the test time while keeping the temperature of the chip under test within a safe range,...
Zhiyuan He, Zebo Peng, Petru Eles, Paul M. Rosinge...
INFOCOM
2003
IEEE
15 years 2 months ago
Optimal Bandwidth Reservation Schedule in Cellular Network
Abstract— Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important p...
Samrat Ganguly, B. R. Badrinath, Navin Goyal
APLAS
2004
ACM
15 years 2 months ago
Network Fusion
Modular programming enjoys many well-known advantages: readability, maintainability, separate development and compilation. However, the composition of modular units (components) s...
Pascal Fradet, Stéphane Hong Tuan Ha
COR
2008
99views more  COR 2008»
14 years 9 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi