90 search results - page 11 / 18 » Combinatorial Benders' Cuts |
ITC
2003
IEEE
14 years 1 months ago
2003
IEEE
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
FCT
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
EOR
2008
13 years 8 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
FUN
2007
Springer
14 years 2 months ago
2007
Springer
The Hydra was a many-headed monster from Greek mythology that would immediately replace a head that was cut off by one or two new heads. It was the ask of Hercules to kill this mon...
ICDCS
2003
IEEE
14 years 1 months ago
2003
IEEE
Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, esp...