Sciweavers

4903 search results - page 56 / 981
» The Set Covering Machine
Sort
View
IJFCS
2006
58views more  IJFCS 2006»
13 years 9 months ago
Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis
Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the ...
Yuli Ye, Janusz A. Brzozowski
ENTCS
2010
99views more  ENTCS 2010»
13 years 9 months ago
State Based Robustness Testing for Components
Component based development allows to build software upon existing components and promises to improve software reuse and reduce costs. To gain reliability of a component based sys...
Bin Lei, Zhiming Liu, Charles Morisset, Xuandong L...
SOICT
2010
13 years 3 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
DAC
2009
ACM
14 years 3 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
ICST
2010
IEEE
13 years 7 months ago
(Un-)Covering Equivalent Mutants
—Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a test suite fails to detect a mutation, it may also fail to...
David Schuler, Andreas Zeller