Sciweavers

2735 search results - page 25 / 547
» Comparing notions of randomness
Sort
View
CSR
2010
Springer
14 years 10 days ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
13 years 9 months ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz
ISCC
2005
IEEE
117views Communications» more  ISCC 2005»
14 years 1 months ago
Real-Time Streaming over Wireless Links: A Comparative Study
Real-time streaming over wireless links is challenging. The streaming protocol must be efficient and robust to random wireless loss, fair to itself, and friendly to legacy TCP. V...
Guang Yang 0001, Ling-Jyh Chen, Tony Sun, Mario Ge...
ICARIS
2005
Springer
14 years 1 months ago
A Comparative Study of Real-Valued Negative Selection to Statistical Anomaly Detection Techniques
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
Thomas Stibor, Jonathan Timmis, Claudia Eckert
ECRTS
2004
IEEE
13 years 11 months ago
Comparing Real-Time Communication Under Electromagnetic Interference
The contribution of this paper is threefold. First, an improvement to a previously published paper on the timing analysis of Controller Area Network (CAN) in the presence of trans...
Ian Broster, Alan Burns, Guillermo Rodrígue...