364 search results - page 73 / 73 » Some Grid Automata for Grid Computing |
104
Voted
ICSE
2007
IEEE-ACM
16 years 1 months ago
2007
IEEE-ACM
Critical infrastructures like the power grid are emerging as collection of existing separated systems of different nature which are interconnected together. Their criticality becom...
96
Voted
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
102
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
113
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...