Sciweavers

4539 search results - page 839 / 908
» Approaches to Compute Workflow Complexity
Sort
View
NSDI
2008
15 years 3 months ago
DieCast: Testing Distributed Systems with an Accurate Scale Model
Large-scale network services can consist of tens of thousands of machines running thousands of unique software configurations spread across hundreds of physical networks. Testing ...
Diwaker Gupta, Kashi Venkatesh Vishwanath, Amin Va...
ANCS
2008
ACM
15 years 3 months ago
Packet prediction for speculative cut-through switching
The amount of intelligent packet processing in an Ethernet switch continues to grow, in order to support of embedded applications such as network security, load balancing and qual...
Paul Congdon, Matthew Farrens, Prasant Mohapatra
DAC
2006
ACM
15 years 3 months ago
Systematic software-based self-test for pipelined processors
Software-based self-test (SBST) has recently emerged as an effective methodology for the manufacturing test of processors and other components in systems-on-chip (SoCs). By moving ...
Mihalis Psarakis, Dimitris Gizopoulos, Miltiadis H...
134
Voted
DAC
2008
ACM
15 years 3 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...
ACST
2006
15 years 2 months ago
PDC: Pattern discovery with confidence in DNA sequences
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Yan Sun, Zijia...