Sciweavers

6028 search results - page 170 / 1206
» Randomness as a resource for design
Sort
View
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 8 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
CORR
2008
Springer
139views Education» more  CORR 2008»
15 years 6 months ago
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
Sunil Srinivasa, Martin Haenggi
CORR
2006
Springer
147views Education» more  CORR 2006»
15 years 6 months ago
ARQ Diversity in Fading Random Access Channels
A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical la...
Young-Han Nam, Praveen Kumar Gopala, Hesham El Gam...
CN
2007
137views more  CN 2007»
15 years 6 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
ET
2002
84views more  ET 2002»
15 years 6 months ago
Hardware Generation of Random Single Input Change Test Sequences
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
René David, Patrick Girard, Christian Landr...