Sciweavers

13214 search results - page 24 / 2643
» Pseudorandomness for network algorithms
Sort
View
CANS
2007
Springer
154views Cryptology» more  CANS 2007»
15 years 11 months ago
Forward-Secure Key Evolution in Wireless Sensor Networks
We consider a key distribution scheme for securing node-to-node communication in sensor networks. While most schemes in use are based on random predistribution, we consider a syste...
Marek Klonowski, Miroslaw Kutylowski, Michal Ren, ...
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 9 months ago
Quadratic Goldreich-Levin Theorems
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Madhur Tulsiani, Julia Wolf
AI
2006
Springer
15 years 9 months ago
On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
Dave A. D. Tompkins, Holger H. Hoos
NETWORKS
1998
15 years 5 months ago
A polynomial algorithm for the p-centdian problem on a tree
Arie Tamir, Dionisio Pérez-Brito, Jos&eacut...
NETWORKS
2007
15 years 5 months ago
The vehicle rescheduling problem: Model and algorithms
Jing-Quan Li, Pitu B. Mirchandani, Denis Borenstei...