Sciweavers

1258 search results - page 1 / 252
» Table design in dynamic programming
Sort
View
IANDC
2006
86views more  IANDC 2006»
13 years 4 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
HIPEAC
2005
Springer
13 years 10 months ago
Dynamic Code Region (DCR) Based Program Phase Tracking and Prediction for Dynamic Optimizations
Detecting and predicting a program’s execution phases are crucial to dynamic optimizations and dynamically adaptable systems. This paper shows that a phase can be associated with...
Jinpyo Kim, Sreekumar V. Kodakara, Wei-Chung Hsu, ...
ICTAI
2010
IEEE
13 years 2 months ago
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving
The abstract goes here.
Neng-Fa Zhou, Yoshitaka Kameya, Taisuke Sato
PADL
2010
Springer
13 years 6 months ago
A Simple and Efficient Implementation of Concurrent Local Tabling
Newer Prolog implementations commonly offer support for multi-threading, and have also begun to offer support for tabling. However, most implementations do not yet integrate tablin...
Rui Marques, Terrance Swift, José C. Cunha
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 9 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers