Sciweavers

2092 search results - page 356 / 419
» A Theory of Non-Deterministic Networks
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
The Impact of Mobility on Gossip Algorithms
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Anand D. Sarwate, Alexandros G. Dimakis
ATAL
2009
Springer
15 years 4 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge
TAMC
2009
Springer
15 years 4 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
CDC
2008
IEEE
116views Control Systems» more  CDC 2008»
15 years 4 months ago
Effective sensing regions and connectivity of agents undergoing periodic relative motions
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
Daniel T. Swain, Ming Cao, Naomi Ehrich Leonard
CEC
2008
IEEE
15 years 4 months ago
Automatic model type selection with heterogeneous evolution: An application to RF circuit block modeling
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...
Dirk Gorissen, Luciano De Tommasi, Jeroen Croon, T...