Sciweavers

1302 search results - page 40 / 261
» Fair Equivalence Relations
Sort
View
AINA
2009
IEEE
14 years 2 months ago
Effects of On-path Buffering on TCP Fairness
Keeping router buffering low helps minimise delay (as well as keeping router costs low), whilst increasing buffering minimises loss. This is a trade-off for which there is no sing...
Saleem N. Bhatti, Martin Bateman
TMC
2008
108views more  TMC 2008»
13 years 8 months ago
Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks
Abstract--Two well-known problems that can cause performance degradations in IEEE 802.11 wireless networks are the exposednode (EN) and hidden-node (HN) problems. Although there ha...
Li Bin Jiang, Soung Chang Liew
JCO
2007
56views more  JCO 2007»
13 years 8 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
FTRTFT
1994
Springer
14 years 1 months ago
Specification and Refinement of Finite Dataflow Networks - a Relational Approach
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
Manfred Broy, Ketil Stølen
JSYML
2007
106views more  JSYML 2007»
13 years 8 months ago
Characterizing rosy theories
We examine several conditions, either the existence of a rank or a particular property of þ-forking that suggest the existence of a well-behaved independence relation, and determi...
Clifton Ealy, Alf Onshuus