Sciweavers

9842 search results - page 1934 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
148
Voted
SASO
2007
IEEE
15 years 10 months ago
An Amortized Tit-For-Tat Protocol for Exchanging Bandwidth instead of Content in P2P Networks
Incentives for resource sharing are crucial for the proper operation of P2P networks. The principle of the incentive mechanisms in current content sharing P2P networks such as Bit...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
163
Voted
AIIA
2007
Springer
15 years 10 months ago
A Hierarchical Clustering Procedure for Semantically Annotated Resources
Abstract. A clustering method is presented which can be applied to relational knowledge bases. It can be used to discover interesting groupings of resources through their (semantic...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
135
Voted
ATAL
2007
Springer
15 years 10 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
137
Voted
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 10 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
155
Voted
CIA
2007
Springer
15 years 10 months ago
Learning Initial Trust Among Interacting Agents
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...
Achim Rettinger, Matthias Nickles, Volker Tresp
« Prev « First page 1934 / 1969 Last » Next »