Sciweavers

2474 search results - page 78 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
BMCBI
2010
198views more  BMCBI 2010»
15 years 4 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
PODC
2009
ACM
15 years 9 months ago
The weakest failure detector for solving k-set agreement
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
Eli Gafni, Petr Kuznetsov
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
15 years 9 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
NC
2006
116views Neural Networks» more  NC 2006»
15 years 4 months ago
Automated Design and Programming of a Microfluidic DNA Computer
Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Base...
Michael S. Livstone, Ron Weiss, Laura F. Landweber
ISORC
2008
IEEE
15 years 11 months ago
Obstacles in Worst-Case Execution Time Analysis
The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information aut...
Raimund Kirner, Peter P. Puschner