Sciweavers

227 search results - page 29 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
ISCA
2007
IEEE
146views Hardware» more  ISCA 2007»
15 years 5 months ago
Hardware atomicity for reliable software speculation
Speculative compiler optimizations are effective in improving both single-thread performance and reducing power consumption, but their implementation introduces significant compl...
Naveen Neelakantam, Ravi Rajwar, Suresh Srinivas, ...
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
13 years 6 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
INFOCOM
2009
IEEE
15 years 5 months ago
Multi-VPN Optimization for Scalable Routing via Relaying
—Enterprise networks are increasingly adopting Layer 3 Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) technology to connect geographically disparate locations...
MohammadHossein Bateni, Alexandre Gerber, Mohammad...
DCC
2005
IEEE
15 years 10 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 5 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry