Sciweavers

1486 search results - page 58 / 298
» Algorithms for two-box covering
Sort
View
66
Voted
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
15 years 9 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
107
Voted
WORDS
2005
IEEE
15 years 6 months ago
Progressive Ranking and Composition of Web Services Using Covering Arrays
Major computer companies and government agencies are adopting Web Services (WS) technology. Web services must ensure interoperability and security, and be reliable and trustworthy...
Charles J. Colbourn, Yinong Chen, Wei-Tek Tsai
CPHYSICS
2008
64views more  CPHYSICS 2008»
15 years 27 days ago
Multibondic cluster algorithm for finite-size scaling studies of critical phenomena
For finite-size scaling studies of second-order phase transitions the critical energy range of interest is usually larger than the energy range covered by a canonical Monte Carlo ...
Bernd A. Berg, Wolfhard Janke
IPCO
2007
77views Optimization» more  IPCO 2007»
15 years 2 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli
84
Voted
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
15 years 6 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev