2084 search results - page 341 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
VLSI
2010
Springer
14 years 4 months ago
2010
Springer
Electro-Magnetic Analysis has been identified as an efficient technique to retrieve the secret key of cryptographic algorithms. Although similar mathematically speaking, Power or E...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
There has been proliferation of research on seeking for distributing the energy consumption among nodes in each cluster and between cluster heads to extend the network lifetime. H...
HPCC
2007
Springer
15 years 4 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...
ICPPW
2006
IEEE
15 years 3 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...