Sciweavers

1424 search results - page 13 / 285
» Improving on Version Stamps
Sort
View
ISPASS
2010
IEEE
15 years 25 days ago
Understanding transactional memory performance
Abstract—Transactional memory promises to generalize transactional programming to mainstream languages and data structures. The purported benefit of transactions is that they ar...
Donald E. Porter, Emmett Witchel
TMC
2008
107views more  TMC 2008»
14 years 10 months ago
A Mutual Network Synchronization Method for Wireless Ad Hoc and Sensor Networks
Mutual network synchronization is a distributed method in which geographically separated clocks align their times to one another without the need of reference or master clocks. Mut...
Carlos H. Rentel, Thomas Kunz
IJCAI
2007
15 years 7 days ago
An Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
Chandrasekar Ramachandran, Thanukrishnan Srinivasa...
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
15 years 4 months ago
An Improved Diversity Mechanism for Solving Constrained Optimization Problems Using a Multimembered Evolution Strategy
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...
Efrén Mezura-Montes, Carlos A. Coello Coell...
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 3 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater