Description: Convex triangle triangle subdivision optimal dynamic programming methods to achieve good efficiency Kazakhstan
To Search:
- [routinescheduling.Rar] - use dynamic programming-solving routine
- [3DDelaunay] - using C and OpenGL-based growth method t
- [Knapsack1] - Two-dimensional knapsack problem
- [39VF160] - S3C2410 bois flashS3C2410 bois flash
- [triSplit] - Optimal convex polygon triangulation, co
- [options] - Examples of dynamic programming algorith
File list (Check if you may need any files):
Download