Results 1  10
of
1,910
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
times the minimum energy required. The analysis involves bounding the largest eigenvalue in matrices of a special type.
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
and old nodes leave the network. Algorithms for such networks need to be robust against changes in topology. Additionally, nodes in sensor networks operate under limited computational, communication, and energy resources. These constraints have motivated the design of “gossip ” algorithms: schemes which
Gossip algorithms: Design, analysis and applications
, 2005
"... Motivated by applications to sensor, peertopeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and information exchange in an arbitrarily connected network of nodes. Nodes in such networks operate under limited computational, co ..."
Abstract

Cited by 225 (13 self)
 Add to MetaCart
, communication and energy resources. These constraints naturally give rise to "gossip" algorithms: schemes which distribute the computational burden and in which a node communicates with a randomly chosen neighbor. We analyze the averaging problem under the gossip constraint for arbitrary network
The Energy of a Graph
, 2007
"... The Deigenvalues of a graph G are the eigenvalues of its distance matrix D, and the Denergy ED(G) is the sum of the absolute values of its Deigenvalues. Two graphs are said to be Dequienergetic if they have the same Denergy. In this note we obtain bounds for the distance spectral radius and De ..."
Abstract

Cited by 117 (9 self)
 Add to MetaCart
The Deigenvalues of a graph G are the eigenvalues of its distance matrix D, and the Denergy ED(G) is the sum of the absolute values of its Deigenvalues. Two graphs are said to be Dequienergetic if they have the same Denergy. In this note we obtain bounds for the distance spectral radius and Denergy
A Thermodynamic Analysis of Energy Eigenvalues
"... The use of the thermodynamic “internal energy ” U as a tool for characterizing eigenvalue spectra is examined via Monte Carlo studies. We show that for pure and complete spectra, internal energy provides significant separation between individual Gaussian orthogonal ensemble (GOE) and Poisson spectra ..."
Abstract
 Add to MetaCart
The use of the thermodynamic “internal energy ” U as a tool for characterizing eigenvalue spectra is examined via Monte Carlo studies. We show that for pure and complete spectra, internal energy provides significant separation between individual Gaussian orthogonal ensemble (GOE) and Poisson
Eigenvalues and energy of restricted unitary Cayley
, 2013
"... ABSTRACT: Let R be a finite commutative ring with unity 1 6 = 0. The restricted unitary Cayley graph induced from the squared mapping is the graph whose vertex set is R and whose edge set is {{a, b} : a, b ∈ R and a − b ∈ TR}, where TR = KR(R ×)2 and KR = {a ∈ R × : a2 = 1}. We study the structure o ..."
Results 1  10
of
1,910