Sciweavers

26071 search results - page 118 / 5215
» Making
Sort
View
97
Voted
CRYPTO
2003
Springer
104views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
Making a Faster Cryptanalytic Time-Memory Trade-Off
Philippe Oechslin
134
Voted
FSTTCS
2003
Springer
15 years 9 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
97
Voted
GECCO
2003
Springer
15 years 9 months ago
What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
Abstract. This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test p...
Jason M. Daida, Hsiaolei Li, Ricky Tang, Adam M. H...
117
Voted
GPCE
2003
Springer
15 years 9 months ago
Making Patterns Explicit with Metaprogramming
Abstract. Design patterns have been a useful tool for a better understanding of the collaboration between several classes and objects in a program. One drawback of this approach is...
Daniel von Dincklage