Sciweavers

1404 search results - page 197 / 281
» On General Laws of Complex Networks
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 4 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
GIS
2008
ACM
15 years 4 months ago
Geographical analysis of hierarchical business structures by interactive drill down
This paper deals with the geographical analysis and visualization of network marketing. The aim of the study was to develop interactive visual methods, which help to answer questi...
Klaus Böhm, Eva Daub
129
Voted
NCA
2010
IEEE
14 years 11 months ago
Composable continuous-space programs for robotic swarms
Programmability is an increasingly important barrier to the deployment of multi-robot systems, as no prior approach allows routine composition and reuse of general aggregate behavi...
Jonathan Bachrach, Jacob Beal, James McLurkin
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
15 years 3 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
DAC
2007
ACM
15 years 8 months ago
Automotive Software Integration
A growing number of networked applications is implemented on increasingly complex automotive platforms with several bus standards and gateways. Together, they challenge the automo...
Razvan Racu, Arne Hamann, Rolf Ernst, Kai Richter