336 search results - page 32 / 68 » Program Speedups in Theory and Practice |
117
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
ICPP
2003
IEEE
15 years 5 months ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
103
click to vote
AIPS
2008
15 years 2 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
106
click to vote
IJFCS
2006
15 years 14 days ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
103
Voted
POPL
1996
ACM
15 years 4 months ago
1996
ACM
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...