Sciweavers

147 search results - page 13 / 30
» Polynomial Fairness and Liveness
Sort
View
ISM
2006
IEEE
253views Multimedia» more  ISM 2006»
14 years 3 months ago
Gossip Based Streaming with Incentives for Peer Collaboration
— Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute band...
Sachin Agarwal, Shruti Dube
CCR
2004
150views more  CCR 2004»
13 years 9 months ago
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
TCP congestion control has been designed to ensure Internet stability along with fair and efficient allocation of the network bandwidth. During the last decade, many congestion co...
Luigi Alfredo Grieco, Saverio Mascolo
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 4 months ago
Finitary languages
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
Krishnendu Chatterjee, Nathanaël Fijalkow
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 11 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
TIME
2008
IEEE
14 years 4 months ago
Practical First-Order Temporal Reasoning
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
Clare Dixon, Michael Fisher, Boris Konev, Alexei L...