Sciweavers

359 search results - page 56 / 72
» On Complete Primitives for Fairness
Sort
View
IC
2003
13 years 8 months ago
Sampling Internet Topologies: How Small Can We Go?
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
Vaishnavi Krishnamurthy, Junhong Sun, Michalis Fal...
IJCAI
2003
13 years 8 months ago
Predicting Web Information Content
In this paper, we propose a novel method to infer the web user’s Information Content (IC), which is the information that the user must examine to complete her task. In particula...
Tingshao Zhu, Russell Greiner, Gerald Häubl, ...
DBSEC
2000
94views Database» more  DBSEC 2000»
13 years 8 months ago
A Fair-exchange E-commerce Protocol with Automated Dispute Resolution
In this paper, we present a fair-exchange electronic commerce (e-commerce) protocol, based on using an online trusted third party, that ensures fairness and prevents any party fro...
Indrajit Ray, Indrakshi Ray, Natarajan Narasimhamu...
ATAL
2010
Springer
13 years 7 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez