Sciweavers

218 search results - page 22 / 44
» Connectivity graphs as models of local interactions
Sort
View
AUTOMATICA
2006
122views more  AUTOMATICA 2006»
13 years 7 months ago
Gibbs sampler-based coordination of autonomous swarms
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
Wei Xi, Xiaobo Tan, John S. Baras
CC
2010
Springer
190views System Software» more  CC 2010»
14 years 2 months ago
Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Xipeng She...
ICCCN
2008
IEEE
14 years 2 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz
DCOSS
2005
Springer
14 years 1 months ago
Infrastructure-Establishment from Scratch in Wireless Sensor Networks
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...
Stefan Funke, Nikola Milosavljevic
ATAL
2007
Springer
14 years 2 months ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima