4469 search results - page 526 / 894 » Dynamic Program Slicing |
158
click to vote
BIOCOMP
2006
15 years 8 months ago
2006
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
199
click to vote
CATA
2006
15 years 8 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...
218
Voted
ACL
1996
15 years 8 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
177
click to vote
NIPS
1993
15 years 8 months ago
1993
This paper introduces GNARL, an evolutionary program which induces recurrent neural networks that are structurally unconstrained. In contrast to constructive and destructive algor...
188
click to vote
PDPTA
1996
15 years 8 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...