2735 search results - page 169 / 547 » Comparing notions of randomness |
ASIACRYPT
2000
Springer
14 years 2 months ago
2000
Springer
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
ACMSE
2007
ACM
14 years 2 months ago
2007
ACM
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
AAAI
2004
13 years 11 months ago
2004
Members of multi-robot teams may need to collaborate to accomplish a task due to differences in capabilities. This paper describes an extension of the ALLIANCE architecture that e...
AAAI
1997
13 years 11 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
SIGCSE
2010
ACM
13 years 10 months ago
2010
ACM
An analysis of data from 259 CS1 students is performed to compare the performance of students who were paired by demonstrated ability to that of students who were paired randomly ...