5314 search results - page 115 / 1063 » Hybrid Dynamic Programming |
COCO
2005
Springer
14 years 3 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
IRAL
2003
ACM
14 years 3 months ago
2003
ACM
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
ISHPC
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
ICPR
2002
IEEE
14 years 11 months ago
2002
IEEE