Sciweavers

168 search results - page 20 / 34
» Dynamic Programming Algorithms for Transition-Based Dependen...
Sort
View
ICS
2007
Tsinghua U.
15 years 3 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
JSA
2008
124views more  JSA 2008»
14 years 9 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
PDPTA
2000
14 years 11 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed
PPPJ
2009
ACM
15 years 4 months ago
Lazy continuations for Java virtual machines
Continuations, or ’the rest of the computation’, are a concept that is most often used in the context of functional and dynamic programming languages. Implementations of such ...
Lukas Stadler, Christian Wimmer, Thomas Würth...