Sciweavers

71228 search results - page 459 / 14246
» Algorithms
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
BMCBI
2007
233views more  BMCBI 2007»
15 years 7 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
JSS
2008
91views more  JSS 2008»
15 years 7 months ago
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
In this paper, we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it inclu...
Ernesto Jiménez, Antonio Fernández, ...
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
15 years 7 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 7 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
« Prev « First page 459 / 14246 Last » Next »