A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...
It is well known that given a network that can become constrained on voltage or real power flows, reserves must also be spatially located in order to handle all credible contingen...
Jie Chen, James S. Thorp, Robert J. Thomas, Timoth...
This paper proposes a new high-level technique for designing fault tolerant systems in SRAM-based FPGAs, without modifications in the FPGA architecture. Traditionally, TMR has bee...
Fernanda Lima, Luigi Carro, Ricardo Augusto da Luz...
With greater integration, the power dissipation in integrated circuits has begun to outpace the ability of today's heat sinks to limit the on-chip temperature. As a result, t...
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...