Sciweavers

10602 search results - page 1826 / 2121
» Weakly Useful Sequences
Sort
View
IEEEPACT
2005
IEEE
16 years 1 months ago
Exploiting Coarse-Grained Parallelism to Accelerate Protein Motif Finding with a Network Processor
While general-purpose processors have only recently employed chip multiprocessor (CMP) architectures, network processors (NPs) have used heterogeneous multi-core architectures sin...
Ben Wun, Jeremy Buhler, Patrick Crowley
INFOCOM
2005
IEEE
16 years 1 months ago
Limiting path exploration in BGP
— Slow convergence in the Internet can be directly attributed to the “path exploration” phenomenon, inherent in all path vector protocols. The root cause for path exploration...
Jaideep Chandrashekar, Zhenhai Duan, Zhi-Li Zhang,...
INFOCOM
2005
IEEE
16 years 1 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
ISCA
2005
IEEE
154views Hardware» more  ISCA 2005»
16 years 1 months ago
Temporal Streaming of Shared Memory
Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Tempor...
Thomas F. Wenisch, Stephen Somogyi, Nikolaos Harda...
KBSE
2005
IEEE
16 years 1 months ago
Automated path generation for software fault localization
Localizing the cause(s) of an observable error lies at the heart of program debugging. Fault localization often proceeds by comparing the failing program run with some “successf...
Tao Wang, Abhik Roychoudhury
« Prev « First page 1826 / 2121 Last » Next »