Sciweavers

353 search results - page 26 / 71
» Dynamic search in peer-to-peer networks
Sort
View
IJMC
2006
84views more  IJMC 2006»
13 years 8 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
INFOSCALE
2006
ACM
14 years 2 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas...
WOWMOM
2005
ACM
240views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
An Adaptive Routing Protocol for Ad Hoc Peer-to-Peer Networks
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, inter...
Luca Gatani, Giuseppe Lo Re, Salvatore Gaglio
ASUNAM
2009
IEEE
14 years 1 months ago
Filtering Spam in Social Tagging System with Dynamic Behavior Analysis
—Spam in social tagging systems introduced by some malicious participants has become a serious problem for its global popularizing. Some studies which can be deduced to static us...
Bo Liu, Ennan Zhai, Huiping Sun, Yelu Chen, Zhong ...
AINA
2009
IEEE
14 years 3 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin