Sciweavers

1265 search results - page 24 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
JSAC
2008
98views more  JSAC 2008»
13 years 7 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
ICCS
2007
Springer
14 years 1 months ago
An ID-Based Random Key Pre-distribution Scheme for Wireless Sensor Networks
When wireless senor networks (WSNs) are deployed in hostile areas, they indeed need to be secured by security mechanisms. To do this, cryptographic keys must be agreed on by commun...
Tran Thanh Dai, Choong Seon Hong
DAC
2002
ACM
14 years 8 months ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
14 years 1 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka