Sciweavers

6506 search results - page 855 / 1302
» Algorithmic models for sensor networks
Sort
View
WWW
2004
ACM
16 years 7 months ago
Dynamic search in peer-to-peer networks
This work* specifically addresses the search issues in unstructured peer-to-peer (P2P) systems that involve the design of an efficient search algorithm, the proposed dynamic searc...
Hsinping Wang, Tsungnan Lin, Chia Hung Chen, Yenna...
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
14 years 6 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
GLOBECOM
2007
IEEE
16 years 15 days ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
VLDB
2005
ACM
125views Database» more  VLDB 2005»
15 years 11 months ago
Using Association Rules for Fraud Detection in Web Advertising Networks
Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications requir...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...