Sciweavers

6409 search results - page 255 / 1282
» A Computational Algorithm for Origami Design
Sort
View
EUROPAR
2006
Springer
15 years 10 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
16 years 1 months ago
A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
Cheng Ling, Khaled Benkrid, Tsuyoshi Hamada
PPOPP
1997
ACM
15 years 10 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
ECAI
2006
Springer
15 years 10 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
ISPAN
1999
IEEE
15 years 10 months ago
Complete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
Si-Gwan Kim, Seung Ryoul Maeng, Jung Wan Cho