Sciweavers

169 search results - page 31 / 34
» Decentralized Search with Random Costs
Sort
View
INFOCOM
2006
IEEE
14 years 22 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
TPDS
2008
105views more  TPDS 2008»
13 years 6 months ago
Analysis of TTL-Based Consistency in Unstructured Peer-to-Peer Networks
Consistency maintenance is important to the sharing of dynamic contents in peer-to-peer (P2P) networks. The TTL-based mechanism is a natural choice for maintaining freshness in P2P...
Xueyan Tang, Jianliang Xu, Wang-Chien Lee
TSMC
2010
13 years 1 months ago
Optimizing Discounted Cash Flows in Project Scheduling - An Ant Colony Optimization Approach
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
Wei-neng Chen, Jun Zhang, Henry Shu-Hung Chung, Ru...
EDCC
2010
Springer
13 years 11 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
COLCOM
2008
IEEE
14 years 1 months ago
Replication in Overlay Networks: A Multi-objective Optimization Approach
Recently, overlay network-based collaborative applications such as instant messaging, content sharing, and Internet telephony are becoming increasingly popular. Many of these appli...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...