Sciweavers

3644 search results - page 440 / 729
» Multi-torrent: a performance study and applications
Sort
View
AMC
2007
124views more  AMC 2007»
15 years 6 months ago
Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers
In this contribution instances of a problem introduced by the differential cryptanalysis of Feistel cryptosystems are formulated as optimization tasks. The performance of Evoluti...
E. C. Laskari, Gerasimos C. Meletiou, Yannis C. St...
CORR
2006
Springer
126views Education» more  CORR 2006»
15 years 6 months ago
Evaluating the Robustness of Learning from Implicit Feedback
This paper evaluates the robustness of learning from implicit feedback in web search. In particular, we create a model of user behavior by drawing upon user studies in laboratory ...
Filip Radlinski, Thorsten Joachims
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
PE
2008
Springer
91views Optimization» more  PE 2008»
15 years 6 months ago
The Foreground-Background queue: A survey
Computer systems researchers have begun to apply the Foreground-Background (FB) scheduling discipline to a variety of applications, and as a result, there has been a resurgence in...
Misja Nuyens, Adam Wierman
TON
2008
105views more  TON 2008»
15 years 6 months ago
Supporting multiple protection strategies in optical networks
This paper develops a framework to support multiple protection strategies in optical networks, which is in general applicable to any connection-oriented network. The capacity avail...
Srinivasan Ramasubramanian