Sciweavers

1794 search results - page 324 / 359
» Visualizing Memory Graphs
Sort
View
ICPP
2006
IEEE
15 years 3 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
PADS
2005
ACM
15 years 3 months ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy
OPODIS
2004
14 years 11 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
CORR
2006
Springer
103views Education» more  CORR 2006»
14 years 9 months ago
Positional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Erich Grädel, Igor Walukiewicz
FEDCSIS
2011
90views more  FEDCSIS 2011»
13 years 9 months ago
Services Composition Model for Home-Automation peer-to-peer Pervasive Computing
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...
Juan A. Holgado-Terriza, Sandra Rodríguez-V...