Sciweavers

317 search results - page 44 / 64
» Benchmarking weak memory models
Sort
View
ICML
2004
IEEE
16 years 16 days ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 6 months ago
Contract-Based Cooperative Spectrum Sharing
—Providing proper economic incentives is essential for the success of dynamic spectrum sharing. Cooperative spectrum sharing is one effective way to achieve this goal. In coopera...
Lingjie Duan, Lin Gao, Jianwei Huang
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 24 days ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya
SPRINGSIM
2008
15 years 1 months ago
Data parallel execution challenges and runtime performance of agent simulations on GPUs
Programmable graphics processing units (GPUs) have emerged as excellent computational platforms for certain general-purpose applications. The data parallel execution capabilities ...
Kalyan S. Perumalla, Brandon G. Aaby
TON
2008
155views more  TON 2008»
14 years 11 months ago
A comparative analysis of server selection in content replication networks
Server selection plays an essential role in content replication networks, such as peer-to-peer (P2P) and content delivery networks (CDNs). In this paper, we perform an analytical i...
Tao Wu, David Starobinski