Sciweavers

244 search results - page 15 / 49
» Analyzing the performance of randomized information sharing
Sort
View
ACMSE
2008
ACM
13 years 9 months ago
Gnutella: integrating performance and security in fully decentralized P2P models
Peer-To-Peer (P2P) systems have made an enormous impact on the Internet, directly affecting its performance and security. The litigation against P2P file sharing has led some desi...
Rossana Motta, Wickus Nienaber, Jon Jenkins
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
Evaluation of gene-expression clustering via mutual information distance measure
Background: The definition of a distance measure plays a key role in the evaluation of different clustering solutions of gene expression profiles. In this empirical study we compa...
Ido Priness, Oded Maimon, Irad E. Ben-Gal
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
ATAL
2004
Springer
14 years 1 months ago
A Multi-Agent Approach for Peer-to-Peer Based Information Retrieval System
This paper develops and analyzes distributed search techniques for use in a peer-to-peer (P2P) network-based Information Retrieval (IR) system. In the absence of a centralized med...
Haizheng Zhang, W. Bruce Croft, Brian Neil Levine,...
AAAI
2006
13 years 9 months ago
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
Austin Parker, Dana S. Nau, V. S. Subrahmanian