Results 1  10
of
2,021,271
Dynamic programming algorithm optimization for spoken word recognition
 IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING
, 1978
"... This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract

Cited by 786 (3 self)
 Add to MetaCart
This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms
Convergence of Stochastic Iterative Dynamic Programming Algorithms
 Neural Computation
, 1994
"... Increasing attention has recently been paid to algorithms based on dynamic programming (DP) due to the suitability of DP for learning problems involving control. In stochastic environments where the system being controlled is only incompletely known, however, a unifying theoretical account of th ..."
Abstract

Cited by 255 (8 self)
 Add to MetaCart
Increasing attention has recently been paid to algorithms based on dynamic programming (DP) due to the suitability of DP for learning problems involving control. In stochastic environments where the system being controlled is only incompletely known, however, a unifying theoretical account
An Adaptive Dynamic Programming Algorithm
 Transportation Science
, 2002
"... We address the problem of dispatching a vehicle with di#erent product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete d ..."
Abstract
 Add to MetaCart
dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product
Staging Dynamic Programming Algorithms
, 2005
"... Applications of dynamic programming (DP) algorithms are numerous, and include genetic engineering and operations research problems. At a high level, DP algorithms are specified as a system of recursive equations implemented using memoization. The recursive nature of these equations suggests that the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Applications of dynamic programming (DP) algorithms are numerous, and include genetic engineering and operations research problems. At a high level, DP algorithms are specified as a system of recursive equations implemented using memoization. The recursive nature of these equations suggests
A Dynamic Programming algorithm for
, 2004
"... minimizing total cost of duplication in scheduling an outtree with communication delays and duplication ..."
Abstract
 Add to MetaCart
minimizing total cost of duplication in scheduling an outtree with communication delays and duplication
2011): Synthesis of firstorder dynamic programming algorithms
 In: OOPSLA
"... To solve a problem with a dynamic programming algorithm, one must reformulate the problem such that its solution can be formed from solutions to overlapping subproblems. Because overlapping subproblems may not be apparent in the specification, it is desirable to obtain the algorithm directly from th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
To solve a problem with a dynamic programming algorithm, one must reformulate the problem such that its solution can be formed from solutions to overlapping subproblems. Because overlapping subproblems may not be apparent in the specification, it is desirable to obtain the algorithm directly from
An improved dynamic programming algorithm for coalition structure generation
 In Proc. of the 7th Int. joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS
, 2008
"... Forming effective coalitions is a major research challenge in the field of multiagent systems. Central to this endeavour is the problem of partitioning the set of agents into exhaustive and disjoint coalitions such that the social welfare is maximized. This coalition structure generation problem is ..."
Abstract

Cited by 49 (17 self)
 Add to MetaCart
is extremely challenging due to the exponential number of partitions that need to be examined. Specifically, given n agents, there are O(n n) possible partitions. To date, the only algorithm that can find an optimal solution in O(3 n) is the Dynamic Programming (DP) algorithm, due to Rothkopf et al. However
Dynamic programming algorithms as products of weighted logic programs
 In Proc. of ICLP
, 2008
"... Abstract. Weighted logic programming, a generalization of bottomup logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm’s output space, such as a path through a graph or a grammatical derivation, and are give ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. Weighted logic programming, a generalization of bottomup logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm’s output space, such as a path through a graph or a grammatical derivation
Results 1  10
of
2,021,271