Sciweavers

1217 search results - page 142 / 244
» Uncertainty-aware circuit optimization
Sort
View
108
Voted
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
16 years 6 days ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 4 months ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster
93
Voted
VLSID
2009
IEEE
155views VLSI» more  VLSID 2009»
16 years 8 days ago
Unified Challenges in Nano-CMOS High-Level Synthesis
: The challenges in nano-CMOS circuit design include the following: variability, leakage, power, thermals, reliability, and yield. This talk will focus on interdependent considerat...
Saraju P. Mohanty
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
15 years 4 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
ICCAD
2006
IEEE
304views Hardware» more  ICCAD 2006»
15 years 8 months ago
Trunk decomposition based global routing optimization
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...
Devang Jariwala, John Lillis