Sciweavers

3958 search results - page 94 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
159
Voted
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
14 years 8 months ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha
GD
2006
Springer
15 years 8 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
178
Voted
PODC
2011
ACM
14 years 7 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
142
Voted
ATAL
2010
Springer
15 years 6 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
WWW
2006
ACM
16 years 5 months ago
Dynamic placement for clustered web applications
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike S...