454:
328:
191:
72:
123:
128:
430:
240:
289:
167:
43:
379:
255:
369:
374:
206:
162:
30:
459:
272:
67:
94:
449:
340:
245:
357:
201:
396:
277:
250:
196:
311:
267:
235:
133:
111:
179:
306:
230:
138:
352:
55:
22:
413:
384:
84:
418:
301:
218:
89:
17:
33:, programming languages which defer to runtime operations normally done while compiling.
408:
323:
443:
150:
99:
42:
The following 48 pages are in this category, out of 48 total.
8:
329:Partially observable Markov decision process
44:This list may not reflect recent changes
39:Pages in category "Dynamic programming"
73:Automatic basis function construction
7:
455:Optimization algorithms and methods
48:
36:
14:
192:Hamilton–Jacobi–Bellman equation
129:Differential dynamic programming
431:WASP (cricket calculation tool)
241:Longest alternating subsequence
380:Stochastic dynamic programming
256:Longest increasing subsequence
1:
370:Shortest common supersequence
31:Dynamic programming languages
124:Damerau–Levenshtein distance
273:Matrix chain multiplication
202:Hirschberg's algorithm
68:Approximate string matching
476:
341:Quadratic knapsack problem
290:Needleman–Wunsch algorithm
246:Longest common subsequence
168:Forward–backward algorithm
28:
16:The main article for this
15:
397:Tabled logic programming
375:Smith–Waterman algorithm
278:Maximum subarray problem
251:Longest common substring
207:Hunt–Szymanski algorithm
163:Floyd–Warshall algorithm
29:Not to be confused with
312:Overlapping subproblems
268:Markov decision process
236:Line wrap and word wrap
134:Dynamic discrete choice
112:Curse of dimensionality
180:Graphical time warping
95:Bellman–Ford algorithm
358:Ruzzo–Tompa algorithm
307:Optimal substructure
231:Levenshtein distance
139:Dynamic time warping
353:Recursive economics
197:Held–Karp algorithm
56:Dynamic programming
23:Dynamic programming
460:Sequential methods
414:Viscosity solution
385:Subset sum problem
85:Backward induction
450:Optimal decisions
419:Viterbi algorithm
467:
302:Optimal stopping
219:Knapsack problem
90:Bellman equation
475:
474:
470:
469:
468:
466:
465:
464:
440:
439:
438:
437:
436:
435:
423:
401:
389:
362:
345:
333:
316:
294:
282:
260:
223:
211:
184:
172:
155:
143:
116:
104:
77:
60:
35:
34:
27:
12:
11:
5:
473:
471:
463:
462:
457:
452:
442:
441:
434:
433:
427:
424:
422:
421:
416:
411:
409:Value function
405:
402:
400:
399:
393:
390:
388:
387:
382:
377:
372:
366:
363:
361:
360:
355:
349:
346:
344:
343:
337:
334:
332:
331:
326:
324:Packrat parser
320:
317:
315:
314:
309:
304:
298:
295:
293:
292:
286:
283:
281:
280:
275:
270:
264:
261:
259:
258:
253:
248:
243:
238:
233:
227:
224:
222:
221:
215:
212:
210:
209:
204:
199:
194:
188:
185:
183:
182:
176:
173:
171:
170:
165:
159:
156:
154:
153:
147:
144:
142:
141:
136:
131:
126:
120:
117:
115:
114:
108:
105:
103:
102:
97:
92:
87:
81:
78:
76:
75:
70:
64:
61:
59:
58:
52:
50:
49:
40:
37:
13:
10:
9:
6:
4:
3:
2:
472:
461:
458:
456:
453:
451:
448:
447:
445:
432:
429:
428:
425:
420:
417:
415:
412:
410:
407:
406:
403:
398:
395:
394:
391:
386:
383:
381:
378:
376:
373:
371:
368:
367:
364:
359:
356:
354:
351:
350:
347:
342:
339:
338:
335:
330:
327:
325:
322:
321:
318:
313:
310:
308:
305:
303:
300:
299:
296:
291:
288:
287:
284:
279:
276:
274:
271:
269:
266:
265:
262:
257:
254:
252:
249:
247:
244:
242:
239:
237:
234:
232:
229:
228:
225:
220:
217:
216:
213:
208:
205:
203:
200:
198:
195:
193:
190:
189:
186:
181:
178:
177:
174:
169:
166:
164:
161:
160:
157:
152:
151:Earley parser
149:
148:
145:
140:
137:
135:
132:
130:
127:
125:
122:
121:
118:
113:
110:
109:
106:
101:
98:
96:
93:
91:
88:
86:
83:
82:
79:
74:
71:
69:
66:
65:
62:
57:
54:
53:
51:
47:
45:
38:
32:
25:
24:
19:
100:Bitonic tour
41:
21:
444:Categories
18:category
20:is
446::
46:.
426:W
404:V
392:T
365:S
348:R
336:Q
319:P
297:O
285:N
263:M
226:L
214:K
187:H
175:G
158:F
146:E
119:D
107:C
80:B
63:A
26:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.