Sciweavers

265 search results - page 15 / 53
» Generating an Assortative Network with a Given Degree Distri...
Sort
View
MSWIM
2005
ACM
14 years 2 months ago
Getting urban pedestrian flow from simple observation: realistic mobility generation in wireless network simulation
In order for precise evaluation of MANET applications, more realistic mobility models are needed in wireless network simulations. In this paper, we focus on the behavior of pedest...
Kumiko Maeda, Kazuki Sato, Kazuki Konishi, Akiko Y...
CEC
2009
IEEE
14 years 3 months ago
Dynamic search initialisation strategies for multi-objective optimisation in peer-to-peer networks
Abstract— Peer-to-peer based distributed computing environments can be expected to be dynamic to greater of lesser degree. While node losses will not usually lead to catastrophic...
Ian Scriven, Andrew Lewis, Sanaz Mostaghim
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
11 years 11 months ago
BloomUnit: declarative testing for distributed programs
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
Peter Alvaro, Andrew Hutchinson, Neil Conway, Will...
APPT
2009
Springer
13 years 6 months ago
The Recursive Dual-Net and Its Applications
Abstract. In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel...
Yamin Li, Shietung Peng, Wanming Chu
MST
2010
187views more  MST 2010»
13 years 3 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda