Sciweavers

900 search results - page 55 / 180
» Design of a Robust Search Algorithm for P2P Networks
Sort
View
INFOCOM
2002
IEEE
14 years 22 days ago
A Robust Acknowledgement Scheme for Unreliable Flows
Abstract—The increasing presence of UDP traffic in the Internet and the emergence of sensing applications which do not require full reliability motivates the search for a robust...
Hoi-sheung Wilson So, Ye Xia, Jean C. Walrand
HPDC
2002
IEEE
14 years 23 days ago
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
Xiaohui Gu, Klara Nahrstedt
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
SIGIR
2006
ACM
14 years 1 months ago
User modeling for full-text federated search in peer-to-peer networks
User modeling for information retrieval has mostly been studied to improve the effectiveness of information access in centralized repositories. In this paper we explore user model...
Jie Lu, James P. Callan
CEC
2010
IEEE
13 years 9 months ago
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...