Skip to search formSkip to main contentSkip to account menu

Dynamic programming

Known as: Dynamic optimization, Dynamic programming/Implementations and Examples, DP 
In mathematics, management science, economics, computer science, and bioinformatics, dynamic programming (also known as dynamic optimization) is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Algorithm designAnytime algorithmBLATBackpropagation

Broader (2)

Mathematical optimizationSystems engineering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Shift-Reduce CCG Parsing
CCGs are directly compatible with binary-branching bottom-up parsing algorithms, in particular CKY and shift-reduce algorithms… 
Highly Cited
2010
Highly Cited
2010
Jena Research Papers in Business and Economics Optimally Routing and Scheduling Tow Trains for JIT-Supply of Mixed-Model Assembly Lines
In recent years, more and more automobile producers adopted the supermarketconcept to enable a exible and reliable Just-in-Time… 
Highly Cited
2009
Highly Cited
2009
Adaptive and optimal control of a non-linear process using intelligent controllers
Highly Cited
2007
Highly Cited
2007
Dynamic predictive scheduling of operational strategies for continuous processes using mixed-logic dynamic optimization
Highly Cited
2006
Highly Cited
2006
Evolutionary computing based mobile robot localization
2004
2004
Distributed receding horizon control of multiagent systems
Multiagent systems arise in several domains of engineering. Examples include arrays of mobile sensor networks for aggregate… 
Highly Cited
2002
Highly Cited
2002
Analysis and modeling of control tasks in dynamic systems
Most applications of evolutionary algorithms deal with static optimization problems. However, in recent years, there has been a… 
Highly Cited
1999
Highly Cited
1999
Iterative Posterior-Based Keyword Spotting Without Filler Models
Keywords: speech Reference EPFL-CONF-82544 Record created on 2006-03-10, modified on 2017-05-12 
Highly Cited
1994
Highly Cited
1994
Automatic Landmark Generation for Point Distribution Models
Point Distribution Models (PDMs) are statistically derived flexible templates which are trained on sets of examples of the object… 
Highly Cited
1990
Highly Cited
1990
Optimal Maintenance Policies for Single-Server Queueing Systems Subject to Breakdowns
We consider a single-server queueing system with Poisson arrivals and general service times. While the server is up, it is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)