Sciweavers

2374 search results - page 87 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 1 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
GCC
2003
Springer
15 years 3 months ago
Modeling Distributed Algorithm Using B
Although there have been several attempts to create grid systems, there is no clear definition for grids. In this paper, a formal approach is presented for defining elementary func...
Shengrong Zou
MICS
2007
88views more  MICS 2007»
14 years 9 months ago
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...
Philip Feinsilver, René Schott
CJ
2008
108views more  CJ 2008»
14 years 10 months ago
Computing with Time: From Neural Networks to Sensor Networks
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...
Boleslaw K. Szymanski, Gilbert Chen
IPPS
2010
IEEE
14 years 7 months ago
Fast Smith-Waterman hardware implementation
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
Zubair Nawaz, Koen Bertels, Huseyin Ekin Sumbul