Sciweavers

2752 search results - page 50 / 551
» Rounding to an Integral Program
Sort
View
IASTEDSEA
2004
13 years 10 months ago
Tube: Interactive model-integrated object-oriented programming
Software engineering is hampered by the fact that software systems quickly become so complex that they are hard to understand, evolve and maintain. Closer integration of code and ...
Axel Rauschmayer, Patrick Renner
PLDI
2003
ACM
14 years 2 months ago
A static analyzer for large safety-critical software
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
Bruno Blanchet, Patrick Cousot, Radhia Cousot, J&e...
DAC
2007
ACM
14 years 9 months ago
Gate Sizing For Cell Library-Based Designs
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
Shiyan Hu, Mahesh Ketkar, Jiang Hu
DAM
2007
107views more  DAM 2007»
13 years 8 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
ORL
2008
91views more  ORL 2008»
13 years 8 months ago
On the integrality ratio for tree augmentation
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
Joseph Cheriyan, Howard J. Karloff, Rohit Khandeka...