1206 search results - page 123 / 242 » Arc-Flags in Dynamic Graphs |
140
click to vote
DIALM
2003
ACM
15 years 9 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
140
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
158
click to vote
ICSE
2001
IEEE-ACM
15 years 8 months ago
2001
IEEE-ACM
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
147
click to vote
WICON
2008
15 years 5 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
132
click to vote
ALENEX
2004
15 years 5 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...