13214 search results - page 19 / 2643 » Pseudorandomness for network algorithms |
145
click to vote
EUROCRYPT
2007
Springer
15 years 11 months ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
140
click to vote
AAIM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
126
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
133
click to vote
ATS
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper considers the testability implications of low power design methodologies. Low power and high testability are shown to be highly contrasting requirements, and an optimiz...