Sciweavers

8497 search results - page 5 / 1700
» Design for an Optimal Probe
Sort
View
ASIAN
2004
Springer
69views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing
Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
Lars Lundberg, Håkan Lennerstad, Kamilla Klo...
CASES
2006
ACM
14 years 1 months ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
BMCBI
2010
99views more  BMCBI 2010»
13 years 8 months ago
Shared probe design and existing microarray reanalysis using PICKY
Background: Large genomes contain families of highly similar genes that cannot be individually identified by microarray probes. This limitation is due to thermodynamic restriction...
Hui-Hsien Chou
E2EMON
2006
IEEE
14 years 1 months ago
Active Probing Approach for Fault Localization in Computer Networks
—Active probing is an active network monitoring technique that has potential for developing effective solutions for fault localization. In this paper we use active probing to pre...
Maitreya Natu, Adarshpal S. Sethi
USENIX
1994
13 years 9 months ago
Probing TCP Implementations
In this paper, we demonstrate a technique called active probing used to study TCP implementations. Active probing treats a TCP implementation as a black box, and uses a set of pro...
Douglas Comer, John C. Lin