Sciweavers

4229 search results - page 418 / 846
» On the Optimality of Spiral Search
Sort
View
180
Voted
ICS
1997
Tsinghua U.
15 years 11 months ago
Optimizing Matrix Multiply Using PHiPAC: A Portable, High-Performance, ANSI C Coding Methodology
Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-speci c hand tuning. We have developed a methodology wh...
Jeff Bilmes, Krste Asanovic, Chee-Whye Chin, James...
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
215
Voted
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
16 years 1 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
180
Voted
EDBT
2008
ACM
194views Database» more  EDBT 2008»
16 years 7 months ago
XCraft: boosting the performance of active XML materialization
An active XML (AXML) document contains tags representing calls to Web services. Therefore, retrieving its contents consists in materializing its data elements by invoking the embe...
Gabriela Ruberg, Marta Mattoso
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
16 years 1 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld