Sciweavers

5314 search results - page 316 / 1063
» Hybrid Dynamic Programming
Sort
View
150
Voted
IR
2008
15 years 6 months ago
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
Kimmo Fredriksson, Szymon Grabowski
IPL
2007
71views more  IPL 2007»
15 years 6 months ago
A short proof of optimality for the MIN cache replacement algorithm
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
Benjamin Van Roy
MOR
2010
91views more  MOR 2010»
15 years 5 months ago
On the One-Dimensional Optimal Switching Problem
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...
Erhan Bayraktar, Masahiko Egami
ACL
2011
14 years 10 months ago
Exact Decoding of Syntactic Translation Models through Lagrangian Relaxation
We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable subprobl...
Alexander M. Rush, Michael Collins
MATES
2009
Springer
16 years 1 months ago
GOAL as a Planning Formalism
Abstract. It has been observed that there are interesting relations between planning and agent programming. This is not surprising as agent programming was partially motivated by t...
Koen V. Hindriks, Tijmen Roberti