Sciweavers

2735 search results - page 528 / 547
» Comparing notions of randomness
Sort
View
CANDC
2006
ACM
13 years 8 months ago
Dealing with repetitions in sequencing by hybridization
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
Jacek Blazewicz, Fred Glover, Marta Kasprzak, Wojc...
CN
2006
91views more  CN 2006»
13 years 8 months ago
Reputation-based policies that provide the right incentives in peer-to-peer environments
Peer-to-peer are popular environments for exchanging services. A reputation mechanism is a proper means of discovering low-performing peers that fail to provide their services. In...
Thanasis G. Papaioannou, George D. Stamoulis
CN
2006
100views more  CN 2006»
13 years 8 months ago
Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds
We consider how to construct and maintain a structured overlay P2P network based on the small-world paradigm. Two main attractive properties of a small-world network are (1) a low...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
CN
2006
60views more  CN 2006»
13 years 8 months ago
Loss strategies for competing AIMD flows
We study in this paper two competing AIMD flows that share a common bottleneck link. When congestion occurs, one (or both) flows will suffer a loss that will cause its throughput ...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T...
ECCC
2006
88views more  ECCC 2006»
13 years 8 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna