Search DaniWeb - dynamic-programming

Dynamic Programming 19 Years Ago by degamer106 Currently, I've been reading about Dynamic Programming in this book and I don't really see the difference between bottom-up dynamic programming and top-down dynamic programming. It seems like both of these techniques do the same thing - compute, save, and finally check to avoid needless recomputation. Any tips?? Dynamic programming 14 Years Ago by -ordi- Hei, I tried to find "dynamic programming" algorithms in Python. If anyone has examples of what it means a dynamic programming, it's would be nice. (Please not post Wikipedia links). Google -> c++, java and other, not Python. Thanks! Re: Dynamic programming 14 Years Ago by TrustyTony Here in this [URL="http://www.daniweb.com/forums/post1245223.html#post1245223"]old thread [/URL]is my code for example for the dynamic programming algorithm for lcs (longest common substring). The link points to version were I only keep one row of record, but original algorithm was indexing normal array. Re: Dynamic programming 14 Years Ago by -ordi- Find that, is dynamic programming? [CODE]from itertools import product n = 21 coins = [11, 10, … dynamic programming 19 Years Ago by geethanjali_t hi , need help in solving the flow shop scheduling problem using dynamic programming dynamic programming problem 16 Years Ago by Lazzi Hi I have to solve this problem with dynamic programming We have system that generates sequence of chars, system can … just need some hints, how to solve it effectivelly with dynamic programming(I found one solution but I think it is too… Re: dynamic programming problem 16 Years Ago by thoughtcoder Oh, this is just a Hidden Markov Model problem, then, isn't it. There are dynamic programming solutions for this. [url]http://en.wikipedia.org/wiki/Viterbi_algorithm[/url] Dynamic Programming problem 14 Years Ago by scholar Hello friends, I have a dynamic programming problem and would like to discuss it here.The problem … Dynamic programming... Maximum value, ignored BEDMAS. Where to begin??? 13 Years Ago by thompsonSensibl Hi there, I have a dynamic programming problem and I have NO idea where to start. You … Re: TSP - dynamic programming 11 Years Ago by DawnofanewEra … why my program (dynamic programming) cannot compute more than… m); void sol(); }; dynamic::dynamic() { r=0; } void dynamic::getdata() { //cout<<…Itimer = new CTimer; //Itimer->Start(); dynamic ts; ts.getdata(); //Itimer->End(); … I need example of dynamic programming 15 Years Ago by Krstevski …'t solve this problem because I have problem with the dynamic programming, so if anyone wants to help me (give example, or… Re: I need example of dynamic programming 15 Years Ago by gusano79 …'t solve this problem because I have problem with the dynamic programming[/QUOTE] I think [URL="http://en.wikipedia.org/wiki… Help with dynamic programming, knapsack problem 14 Years Ago by jssutton11 … a code to solve the knapsack 0-1 problem by dynamic programming. At a certain point, around 30 max capacity, the code… TSP - dynamic programming 11 Years Ago by DawnofanewEra Why are some algorithm to solve TSP using dynamic programming can solve up to 10 cities while some can go beyond that...i.e. 10, 100 or more..!! What is the factor that determines the capability of the algortihm to solve more than 10 or less..?? Re: TSP - dynamic programming 11 Years Ago by kal_crazy For dynamic programming we are breaking down the problem into sub-problems hence … How to solve gold mine problem with dynamic programming 3 Years Ago by Khoa_2 Hi everyone, i want to solve the problem below with dynamic programming but i dont know where to start. Can anyone suggest … Re: How to solve gold mine problem with dynamic programming 3 Years Ago by rproffitt There are tutorials about this on the web so it's time to use those as my approach is unlikely to be accepted for academic assignments. Example: https://www.tutorialcup.com/interview/dynamic-programming/gold-mine-problem.htm In real life you could burn through all the possible solutions since CPU time is so cheap today. Re: Dynamic Programming 19 Years Ago by iamthwee >[url]http://en.wikipedia.org/wiki/Dynamic_programming[/url] Re: Dynamic programming 14 Years Ago by -ordi- Hei, enybody knows where I find a traveling salesman algorithm? Or anybody is implementing this thanks! Re: Dynamic programming 14 Years Ago by richieking This is even a basic one. Python can do almost everything you want to do. :) Re: dynamic programming 19 Years Ago by Salem [url]http://www.daniweb.com/techtalkforums/announcement8-2.html[/url] Dynamic Scheduling Problem 13 Years Ago by aphide … to go about this problem but, I'm new to dynamic programming in general. Sorry for the lengthy problem description, but I… Re: dynamic programming problem 16 Years Ago by thoughtcoder First you say you have a sequence of chars, but then you say you have a matrix of chars. Which is it? Re: dynamic programming problem 16 Years Ago by thoughtcoder Wait, I misread you -- how is an nxn matrix of chars an input? Re: dynamic programming problem 16 Years Ago by Lazzi I am sorry I wrote that in a hurry, so it is hard to understand Here is an example of input: 2 3 // n m 10 90 //matrix of posibilities nxn 90 10 aa //matrix of chars nxn ab aab //final sequence of chars with length m And my task is to find most probable way how was the final sequence created. Re: dynamic programming problem 16 Years Ago by thoughtcoder Edit: never mind. Re: Dynamic Programming problem 14 Years Ago by Adak You can't delete an element from an array - they are fixed. Why don't you post a simple example of what you want to do. Your description is dodgy, (or maybe it's just too early?). ;) Re: Dynamic Programming problem 14 Years Ago by scholar Thanks for reply. Here is an example. Suppose the given array is 1 3 2 8 4 We have to convert it to an array in such a way that all elements are in non decreasing order. An example would be 1 2 2 5 4 No that is possible in various manner. The cost for above transformation would be 0+1+0+3+0=4 We have to find the minimum cost for transformation. … Re: Dynamic Programming problem 14 Years Ago by Adak Note: non-decreasing == ascending order ;) Fewest number of comparisons: Insertion sort. Fewest number of swaps: Selection sort. No comparisons at all: Counting sort (if the data is ranged OK for it) So we're not trying to move the values (like using a sort), we're adjusting their values, and counting the cost incurred, until the numbers are in … Knap-Sack Problem Using Dynamic Programming 11 Years Ago by zulqarnain02 Can anyone please eleborate this project.I have to make a console application of it. Please tell me what is knap-sack and whats the concept behind its programming.