Sciweavers

571 search results - page 112 / 115
» Performing causality analysis by bounded model checking
Sort
View
INFOCOM
2007
IEEE
15 years 10 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
SPAA
2005
ACM
15 years 9 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
TCOM
2010
101views more  TCOM 2010»
14 years 10 months ago
Spectral efficient transmit diversity techniques without cyclic prefix for fading relay channels
Abstract--This paper proposes spectral efficient relayassisted transmit diversity techniques, i.e., space-time and space-frequency block codes (STBC/SFBC), for single carrier frequ...
Ui-Kun Kwon, Dae-Young Seol, Gi-Hong Im
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 7 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
DGO
2007
124views Education» more  DGO 2007»
15 years 5 months ago
Assessing capability for justice information sharing
Enhanced information sharing among criminal justice agencies is a critical concern and a goal of much IT investment. Understanding agencies’ capabilities to achieve this goal is...
Anthony M. Cresswell, Theresa A. Pardo, Shahidul H...