Sciweavers

207 search results - page 15 / 42
» Powers of cycles, powers of paths, and distance graphs
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
IJAHUC
2006
129views more  IJAHUC 2006»
13 years 7 months ago
Optimal distance geographic routing for energy efficient wireless sensor networks
: Wireless sensor networks require energy efficient routing protocols owing to limited resource on the sensor node. In this paper, we develop optimal distance geographic routing (O...
Xin-Ming Huang, Jing Ma
SIROCCO
2010
13 years 9 months ago
Multipath Spanners
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
Cyril Gavoille, Quentin Godfroy, Laurent Viennot
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
14 years 4 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson
ORL
2006
103views more  ORL 2006»
13 years 7 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa