SIGPRO
2008
14 years 10 days ago
2008
In this paper, we present an algorithm for multichannel blind deconvolution of seismic signals, which exploits lateral continuity of earth layers by dynamic programming approach. ...
SAC
2006
ACM
14 years 10 days ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
EOR
2007
14 years 12 days ago
2007
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionai...
CORR
2007
Springer
14 years 12 days ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
CORR
2007
Springer
14 years 12 days ago
2007
Springer
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
IOR
2008
14 years 13 days ago
2008
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
IANDC
2006
14 years 13 days ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
EOR
2006
14 years 13 days ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
DISOPT
2006
14 years 14 days ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...