5183 search results - page 33 / 1037 » The Complexity of Distributions |
AMC
2007
13 years 7 months ago
2007
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
PODC
2005
ACM
14 years 29 days ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....