Sciweavers

PPL
2010
117views more  PPL 2010»
13 years 6 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
PPL
2010
118views more  PPL 2010»
13 years 9 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
PPL
2010
147views more  PPL 2010»
13 years 9 months ago
Key Distribution versus Key Enhancement in Quantum Cryptography
It has been said that quantum cryptography in general o ers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, ...
Naya Nagy, Marius Nagy, Selim G. Akl
PPL
2010
97views more  PPL 2010»
13 years 9 months ago
On the Importance of Being Quantum
Game playing is commonly cited in debates concerning human versus machine intelligence, and Chess is often at the center of such debates. However, the role of Chess in delineating...
Selim G. Akl
PPL
2010
75views more  PPL 2010»
13 years 9 months ago
On the Input Acceptance of Transactional Memory
We present the Input Acceptance of Transactional Memory (TM). Despite the large interest for performance of TMs, no existing research work has investigated the impact of solving a...
Vincent Gramoli, Derin Harmanci, Pascal Felber
PPL
2010
80views more  PPL 2010»
13 years 9 months ago
Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems
Eddy Caron, Frédéric Desprez, Franck...