Sciweavers

1028 search results - page 134 / 206
» Measuring Distributional Similarity in Context
Sort
View
CONCUR
2006
Springer
14 years 15 days ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
ICDCS
1995
IEEE
14 years 9 days ago
A Competitive Analysis for Retransmission Timeout
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
Shlomi Dolev, Michael Kate, Jennifer L. Welch
EUROPAR
2009
Springer
13 years 6 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
IMC
2006
ACM
14 years 2 months ago
Understanding churn in peer-to-peer networks
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requir...
Daniel Stutzbach, Reza Rejaie
AAAI
2000
13 years 10 months ago
Recognizing End-User Transactions in Performance Management
Providing good quality of service (e.g., low response times) in distributed computer systems requires measuring enduser perceptions of performance. Unfortunately, such measures ar...
Joseph L. Hellerstein, T. S. Jayram, Irina Rish