GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Main page
  • Contents
  • Current events
  • Random article
  • About Wikipedia
  • Contact us
  • Help
  • Learn to edit
  • Community portal
  • Recent changes
  • Upload file
  • Special pages
  • Search
  • Donate

This view

  • Original page
  • New address

GeezerVison is showing en.wikipedia.org — Category:Dynamic programming - Wikipedia

Help
The main article for this category is Dynamic programming.
Not to be confused with Dynamic programming languages, programming languages which defer to runtime operations normally done while compiling.

Pages in category "Dynamic programming"

The following 49 pages are in this category, out of 49 total. This list may not reflect recent changes.

 

  • Dynamic programming

A

  • Approximate string matching
  • Automatic basis function construction

B

  • Backward induction
  • Bellman equation
  • Bellman–Ford algorithm
  • Bitonic tour

C

  • Curse of dimensionality

D

  • Damerau–Levenshtein distance
  • Differential dynamic programming
  • Dynamic discrete choice
  • Dynamic time warping

E

  • Earley parser

F

  • Floyd–Warshall algorithm
  • Forward–backward algorithm

G

  • Graphical time warping

H

  • Hamilton–Jacobi–Bellman equation
  • Held–Karp algorithm
  • Hirschberg's algorithm
  • Hunt–Szymanski algorithm

I

  • Invariant imbedding

K

  • Knapsack problem

L

  • Levenshtein distance
  • Longest alternating subsequence
  • Longest common subsequence
  • Longest common substring
  • Longest increasing subsequence

M

  • Markov decision process
  • Matrix chain multiplication
  • Maximum subarray problem

N

  • Needleman–Wunsch algorithm

O

  • Optimal stopping
  • Optimal substructure
  • Overlapping subproblems

P

  • Packrat parser
  • Partially observable Markov decision process

Q

  • Quadratic knapsack problem

R

  • Recursive economics
  • Ruzzo–Tompa algorithm

S

  • Shortest common supersequence
  • Smith–Waterman algorithm
  • Stochastic dynamic programming
  • Subset sum problem

T

  • Tabled logic programming

V

  • Value function
  • Viscosity solution
  • Viterbi algorithm

W

  • WASP (cricket calculation tool)
  • Wrapping (text)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Dynamic_programming&oldid=1334923127"
Categories:
  • Optimal decisions
  • Optimization algorithms and methods
  • Sequential methods
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.