Sciweavers

163 search results - page 8 / 33
» Supporting ranked search in parallel search cluster networks
Sort
View
HIPC
2004
Springer
14 years 1 months ago
Design of a Robust Search Algorithm for P2P Networks
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-...
Niloy Ganguly, Geoffrey Canright, Andreas Deutsch
ISPDC
2008
IEEE
14 years 2 months ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
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...
Jonathan Widger, Daniel Grosu
IR
2006
13 years 8 months ago
Full-text federated search of text-based digital libraries in peer-to-peer networks
Abstract. Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalabl...
Jie Lu, Jamie Callan
AAAI
2011
12 years 8 months ago
Cross-Language Latent Relational Search: Mapping Knowledge across Languages
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...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...
WWW
2004
ACM
14 years 8 months ago
Distributed ranking over peer-to-peer networks
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...
Dexter Chi Wai Siu, Tak Pang Lau