Sciweavers

207 search results - page 11 / 42
» Powers of cycles, powers of paths, and distance graphs
Sort
View
CASES
2006
ACM
13 years 11 months ago
Power efficient branch prediction through early identification of branch addresses
Ever increasing performance requirements have elevated deeply pipelined architectures to a standard even in the embedded processor domain, requiring the incorporation of dynamic b...
Chengmo Yang, Alex Orailoglu
MSN
2007
Springer
14 years 1 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
HICSS
2010
IEEE
193views Biometrics» more  HICSS 2010»
14 years 2 months ago
The Topological and Electrical Structure of Power Grids
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
Paul Hines, Seth Blumsack, E. Cotilla Sanchez, C. ...
MP
2007
100views more  MP 2007»
13 years 7 months ago
Power optimization for connectivity problems
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. ...
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
14 years 1 months ago
Distance Coloring
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
Alexa Sharp