Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,585,287 papers from all fields of science
Search
Sign In
Create Free Account
Dynamic programming
Known as:
Dynamic optimization
, Dynamic programming/Implementations and Examples
, DP
Expand
In mathematics, management science, economics, computer science, and bioinformatics, dynamic programming (also known as dynamic optimization) is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithm design
Anytime algorithm
BLAT
Backpropagation
Expand
Broader (2)
Mathematical optimization
Systems engineering
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Flexible transceivers
K. Roberts
,
C. Laperle
European Conference and Exhibition on Optical…
2012
Corpus ID: 41620767
The introduction of coherent transceivers in high capacity optical transmission systems has dramatically increased networking…
Expand
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
N. Boysen
2010
Corpus ID: 14264961
In recent years, more and more automobile producers adopted the supermarketconcept to enable a exible and reliable Just-in-Time…
Expand
Highly Cited
2009
Highly Cited
2009
Adaptive and optimal control of a non-linear process using intelligent controllers
N. S. Bhuvaneswari
,
G. Uma
,
T. Rangaswamy
Applied Soft Computing
2009
Corpus ID: 205700153
Highly Cited
2007
Highly Cited
2007
Optimal Electrical Distribution Systems Reinforcement Planning Using Gas Micro Turbines by Dynamic Ant Colony Search Algorithm
S. Favuzza
,
Giorgio Graditi
,
M. Ippolito
,
E. R. Sanseverino
IEEE Transactions on Power Systems
2007
Corpus ID: 23946891
Distribution systems management is becoming an increasingly complicated issue due to the introduction of new energy trading…
Expand
Highly Cited
2004
Highly Cited
2004
Constructing Dynamic Optimization Test Problems Using the Multi-objective Optimization Concept
Yaochu Jin
,
B. Sendhoff
EvoWorkshops
2004
Corpus ID: 2774529
Dynamic optimization using evolutionary algorithms is receiving increasing interests. However, typical test functions for…
Expand
Highly Cited
2000
Highly Cited
2000
Optimizing Queries on Compressed Bitmaps
S. Amer-Yahia
,
T. Johnson
Very Large Data Bases Conference
2000
Corpus ID: 572007
OptimizingQueriesOnCompressedBitmapsSihem Amer-YahiaAT&T Labs{Researchsihem@research.att.comTheo doreJohnsonjohnsont@research.att…
Expand
Highly Cited
1998
Highly Cited
1998
Multiobjective dynamic optimization of an industrial Nylon 6 semibatch reactor using genetic algorit
K. Mitra
,
K. Deb
,
Sumit Gupta
1998
Corpus ID: 14625097
The nondominated sorting genetic algorithm (NSGA) is adapted and used to obtain multiobjective Pareto optimal solutions for three…
Expand
Highly Cited
1996
Highly Cited
1996
On optimal piggyback merging policies for video-on-demand systems
C. Aggarwal
,
J. Wolf
,
Philip S. Yu
Measurement and Modeling of Computer Systems
1996
Corpus ID: 12592296
A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests…
Expand
Highly Cited
1994
Highly Cited
1994
Taxonomy of dynamic task scheduling schemes in distributed computing systems
H. G. Rotithor
1994
Corpus ID: 62649282
System state estimation and decision making are the two major components of dynamic task scheduling in a distributed computing…
Expand
Highly Cited
1991
Highly Cited
1991
Thermal constraints and optimization of winter feeding and habitat choice in white-tailed deer
O. Schmitz
1991
Corpus ID: 30724484
I examined the activity and habitat choice of white-tailed deer in winter to determine how deer balance feeding in habitats which…
Expand
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)
ACCEPT & CONTINUE