659 search results - page 105 / 132 » Dynamic Algorithms for Graph Spanners |
IPSN
2004
Springer
15 years 3 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
116
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
108
click to vote
SP
2009
IEEE
15 years 4 months ago
2009
IEEE
Malware authors have recently begun using emulation technology to obfuscate their code. They convert native malware binaries into bytecode programs written in a randomly generated...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— 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...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...