Sciweavers

1093 search results - page 179 / 219
» Crossover in Probability Spaces
Sort
View
TIT
1998
127views more  TIT 1998»
13 years 10 months ago
The Art of Signaling: Fifty Years of Coding Theory
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
A. Robert Calderbank
SIGMETRICS
2002
ACM
107views Hardware» more  SIGMETRICS 2002»
13 years 10 months ago
Passage time distributions in large Markov chains
Probability distributions of response times are important in the design and analysis of transaction processing systems and computercommunication systems. We present a general tech...
Peter G. Harrison, William J. Knottenbelt
TON
2002
175views more  TON 2002»
13 years 10 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
TPDS
2002
80views more  TPDS 2002»
13 years 10 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
IEICET
2007
90views more  IEICET 2007»
13 years 9 months ago
Multi-Point Simulated Annealing with Adaptive Neighborhood
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
Keiko Ando, Mitsunori Miki, Tomoyuki Hiroyasu