Sciweavers

441 search results - page 38 / 89
» Generic Timing Fault Tolerance using a Timely Computing Base
Sort
View
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
TCAD
2008
114views more  TCAD 2008»
13 years 7 months ago
Test-Quality/Cost Optimization Using Output-Deviation-Based Reordering of Test Patterns
At-speed functional testing, delay testing, and n-detection test sets are being used today to detect deep submicrometer defects. However, the resulting test data volumes are too hi...
Zhanglei Wang, Krishnendu Chakrabarty
AINA
2006
IEEE
14 years 1 months ago
A Hybrid Rule-Based/Case-Based Reasoning Approach for Service Fault Diagnosis
— In today’s service market the provisioning of high quality services has become a critical issue for providers as the business success of their customers is often based on the...
Andreas Hanemann
ICDCSW
2002
IEEE
14 years 19 days ago
Quantifying Effect of Network Latency and Clock Drift on Time-Driven Key Sequencing
Time-driven Key Sequencing (TKS) is a key management technique that synchronizes the session key used by a set of communicating principals based on time of day. This relatively lo...
Geoffrey G. Xie, Cynthia E. Irvine, Timothy E. Lev...
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...