Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
ABSTRACT DYNAMIC PROGRAMMING MODELS UNDER COMMUTATIVITY CONDITIONS.
Sergio Verdu,
H. Vincent Poor
Electrical and Computer Engineering
Mathematics
High Meadows Environmental Institute
Research output
:
Contribution to journal
›
Article
›
peer-review
55
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'ABSTRACT DYNAMIC PROGRAMMING MODELS UNDER COMMUTATIVITY CONDITIONS.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Commutativity Conditions
100%
Cost-to-go Function
50%
Dynamic Programming
50%
Dynamic Programming Model
100%
Extremization
50%
Forward Model
100%
Optimization Problem
50%
Problem-based
50%
Recursive Definition
50%
Sequential Problem
50%
Simultaneous Solution
50%
Computer Science
Commutativity
100%
Dynamic Programming
100%
Objective Function
33%
Optimization Problem
33%
Programming Model
100%
Recursive Definition
33%
Sufficient Condition
66%
Mathematics
Commutativity
100%
Extremization
50%
Objective Function
50%
Recursive Definition
50%
Sufficient Condition
100%
Economics, Econometrics and Finance
Dynamic Programming
100%