163 search results - page 8 / 33 » Supporting ranked search in parallel search cluster networks |
152
click to vote
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we report a decentralized algorithm, termed ImmuneSearch, for searching p2p networks. ImmuneSearch avoids query message flooding; instead it uses an immune-systems-...
162
click to vote
ISPDC
2008
IEEE
16 years 13 days ago
2008
IEEE
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
173
click to vote
IR
2006
15 years 6 months ago
2006
Abstract. Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalabl...
187
click to vote
AAAI
2011
14 years 6 months ago
2011
Latent relational search (LRS) is a novel approach for mapping knowledge across two domains. Given a source domain knowledge concerning the Moon, “The Moon is a satellite of the...
143
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...