Sciweavers

365 search results - page 40 / 73
» Reconfigurations in Graphs and Grids
Sort
View
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 11 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 11 months ago
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
Daniel W. Cranston, Gexin Yu
ESCIENCE
2007
IEEE
14 years 5 months ago
A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
Mustafizur Rahman 0003, Srikumar Venugopal, Rajkum...
SC
2004
ACM
14 years 4 months ago
Improving Throughput for Grid Applications with Network Logistics
This work describes a technique for improving network performance in Grid environments that we refer to as “logistics.” We demonstrate that by using storage and cooperative fo...
D. Martin Swany
IPPS
1999
IEEE
14 years 3 months ago
The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varv...