Sciweavers

2922 search results - page 130 / 585
» Scalable Algorithms for Distribution Search
Sort
View
150
Voted
ICDCS
2000
IEEE
15 years 8 months ago
The Effect of Nogood Learning in Distributed Constraint Satisfaction
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
Makoto Yokoo, Katsutoshi Hirayama
139
Voted
SPAA
2010
ACM
15 years 8 months ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
142
Voted
CLOUD
2010
ACM
15 years 8 months ago
G-Store: a scalable data store for transactional multi key access in the cloud
Cloud computing has emerged as a preferred platform for deploying scalable web-applications. With the growing scale of these applications and the data associated with them, scalab...
Sudipto Das, Divyakant Agrawal, Amr El Abbadi
138
Voted
IPPS
1998
IEEE
15 years 7 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
145
Voted
ICPADS
1998
IEEE
15 years 8 months ago
Probability Based Replacement Algorithm for WWW Server Arrays
This paper describes a scalable Web server array architecture which uses a caching policy called Probability Based Replacement (PBR) algorithm [5, 6]. The server array consists of...
K. H. Yeung, K. W. Suen