Finding optimal path on a terrain by Auralius Manurung

Finding optimal path on a terrain using forward dynamic programming. (dynamic programming, optimal path, shortst path)

createTransitionCostMat(T)

dpa(P, startNode)

drawTerrain(T)

Edit Distance Algorithm by Reza Ahmadzadeh

Edit Distance is a standard Dynamic Programming problem. (mathematics, search, dynamic programming)

EditDistance(string1,string2)

Markov Decision Processes (MDP) Toolbox by Marie-Josee Cros

Functions related to the resolution of discrete-time Markov Decision Processes. (control design, markov decision proce..., optimization)

[V,mean_discrepancy]=mdp_eval_policy_TD_0(P,R,discount,poli...

mdp_LP(P, R, discount)

mdp_Q_learning(P, R, discount, N)

[SigGraph2002] Image Quilting/Texture Synthesize by Li Cheng

Matlab code to do Image Quilting as presented in the SIGGRAPH 2002 paper by Efros & Freeman. (image processing, siggraph, graphic)

getxcorr2(A,B)

synthesize(imin, sizeout, tilesize, overlap , isdebug)

example.m

KP01 by Jonas Lundgren

Solves the 0-1 knapsack problem using preprocessing and dynamic programming. (optimization, dynamic programming, knapsack)

kp01(w,p,c,maxit)

2D random paths generator integrating leg's contraints by Sebastien PARIS

Generates random 2D leg'paths from departure to arrival integrating leg's constraints (random paths, dynamic programming, legs contraints)

circulant.m

exclusion.m

indice_ij.m

Cops and Robber Software by Athanasios Kehagias

Functions to compute optimal schedules for a team of cops chasing a robber on a graph (mathematics, pursuit evasion, graph theory)

P=grf2P01(fname)

[EC,ER]=CRcheq(C,R,P)

[F,CT,DCT,mopta,moptd]=CRcod(Ca,Ra,Cd)

Dynamic Programming solution to the TSP by Elad Kivelevitch

This function solves the Traveling Salesman Problem (TSP) using Dynamic programming (DP). (dynamic programming, tsp, optimization)

[OptimalTour,mincost]=tsp_dp1(cities, Dmatrix)

Forward Viterbi Algorithm by David Conger

Forward Viterbi algorithm based on: http://en.wikipedia.org/wiki/Viterbi_algorithm (viterbi algorithm, hidden markov model, dynamic programming)

forward_viterbi(obs,states,start_p,trans_p,emit_p)

runViterbi.m

0-1 Knapsack by Petter

Solves the 0-1 knapsack problem with positive integer weights. (01 knapsack, dynamic programming, knapsack)

knapsack(weights, values, W)

knapsack_demo

Dynamic Programming solver for The bridge crossing problem by Gianluca Dorini

The bridge crossing problem is here modelled and solved as undiscounted Dynamic Programming problem. (dynamic programming, optimization)

crossBridge(T)