3471 search results - page 583 / 695 » Obstacle Numbers of Graphs |
144
Voted
SENSYS
2006
ACM
15 years 11 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
138
Voted
SIGMETRICS
2005
ACM
15 years 10 months ago
2005
ACM
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
145
Voted
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
152
click to vote
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
149
Voted
EMSOFT
2004
Springer
15 years 10 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...