﻿<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><copyright>Copyright 2003-2026 Bug &amp; dizzy.hr</copyright><ttl>30</ttl><pubDate>Wed, 29 Apr 2026 03:34:05 GMT</pubDate><managingEditor>pisma@bug.hr</managingEditor><language>hr</language><lastBuildDate>Thu, 23 Jun 2011 13:33:46 GMT</lastBuildDate><description>Tema unutar podforuma Programiranje</description><title>Knapsack problem(dinamičko programiranje)</title><link>http://forum.bug.hr/forum/topic/programiranje/knapsack-problemdinamicko-programiranje/105047.aspx</link><image><url>http://www.bug.hr/images/forum-rss.gif</url></image><item><title>Knapsack problem(dinamičko programiranje)</title><description>Primjeri klasicnog knapsacka ... Pa tko umire od dosade neka razbija glavu ...https://www.spoj.pl/problems/SOLDIER/https://www.spoj.pl/problems/SCUBADIV/&amp;nbsp;</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2036290.aspx</link><pubDate>Thu, 23 Jun 2011 13:33:46 GMT</pubDate><guid isPermaLink="false">3af1769de4ed2f29f2dc7e3e1bc194bc</guid><category /></item><item><title>Knapsack problem(dinamičko programiranje)</title><description>Milslim da vam ja mogu pomoci. Nisam suguran dokle ste stigli i sto ima u onim materijalima jer nisam citao vase prijasnje postove, pa je moguce da moj post bude viska.Vidio sam da je netko predlagao ...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2036247.aspx</link><pubDate>Thu, 23 Jun 2011 13:20:49 GMT</pubDate><guid isPermaLink="false">1dd88ee62a2c79ee2ca7545817e2bdec</guid><category /></item><item><title>Knapsack problem(dinamičko programiranje)</title><description>- za ovakav tip problema, dobar primjer bi bila igra Elite... problem količine novca, ponuđene robe, cargo spacea i razlike u cijeni koja se može ostvariti.. u Elit se najbolje ta kombinacija očituje ...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2036183.aspx</link><pubDate>Thu, 23 Jun 2011 12:45:08 GMT</pubDate><guid isPermaLink="false">2ab92a27944da296eba7380545ac92b2</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Kod mene je slična situacija. Meni je lakše kad nešto mogu nekako vizualizirati. Zato volim OOP.KKristijan kaže...&amp;nbsp; Učio bih ja sve i po redu da imam otkuda :-DEvo jedan uvod:http://www.cs.berkel...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2036017.aspx</link><pubDate>Thu, 23 Jun 2011 11:37:29 GMT</pubDate><guid isPermaLink="false">a914d417a41df216123fd718570dc6bd</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>&amp;nbsp; Učio bih ja sve i po redu da imam otkuda :-D</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2035974.aspx</link><pubDate>Thu, 23 Jun 2011 11:25:38 GMT</pubDate><guid isPermaLink="false">880b2725d6dd912bafaa042815446d28</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Tako sto mi kreativna (desna) strana mozga nadjacava onu logicku (lijevu). Programiranjem sam se prije 11 godina poceo samo iz jednog razloga, htio sam stvarati. Citanje o algoritmima (pogotovo algori...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2035941.aspx</link><pubDate>Thu, 23 Jun 2011 11:15:50 GMT</pubDate><guid isPermaLink="false">60bc65b3c9069bfa57aa69d79a6e5d0f</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Tvoj je izbor.&amp;nbsp;No mislim da je glupo ići na neke malo složenije algoritme ako nisi savladao jednostavnije i ako ne znaš ništa algoritmima. Algoritmi se uče isto kao matematika.&amp;nbsp;</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2035911.aspx</link><pubDate>Thu, 23 Jun 2011 11:03:28 GMT</pubDate><guid isPermaLink="false">2c5d16c83b98fb47f69436b8b3e6c8e0</guid><category /></item><item><title>Knapsack problem(dinamičko programiranje)</title><description>Ispocetka?pa nije to matematika...ucis one koje ti trebaju </description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2035721.aspx</link><pubDate>Thu, 23 Jun 2011 09:58:59 GMT</pubDate><guid isPermaLink="false">8dc4621642076c71e6e36ee49422798a</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Ne razumijem kako možeš biti ne pametan za rješavanje problema. Jedino možeš ne imati dovoljno znanja za rješavanje problema.Evo jedan link:http://www.cs.berkeley.edu/~vazirani/algorithms/chap6.pdf&amp;nb...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2035367.aspx</link><pubDate>Thu, 23 Jun 2011 05:38:24 GMT</pubDate><guid isPermaLink="false">357cfc858a59e1cb9d035be16e87a3e6</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>&amp;nbsp; Znam kako ti je...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2035174.aspx</link><pubDate>Wed, 22 Jun 2011 22:34:01 GMT</pubDate><guid isPermaLink="false">9da47bd4d0dbdf16e1fe21fbc584cb1d</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Zato se to zove aproksimacija :DA sta ja znam... bojim se da nisam dovoljno pametan za rjesavanje tog problema na pravilan nacin.</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034909.aspx</link><pubDate>Wed, 22 Jun 2011 20:58:00 GMT</pubDate><guid isPermaLink="false">ad47a50a01a7f4fd3733f990ee510dac</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Recimo da ti predmet s najvećim omjerom (npr 1.01) zauzima 90 % kapaciteta, a sljedeći predmeti na listi imaju omjer vrijednosti npr 1 i zauzimaju 20 % kapaciteta i nakon 5 takvih imaš predmet koji za...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034800.aspx</link><pubDate>Wed, 22 Jun 2011 20:16:10 GMT</pubDate><guid isPermaLink="false">092d3828b9294da010310ea0783407ea</guid><category /></item><item><title>Knapsack problem(dinamičko programiranje)</title><description>http://docs.google.com/viewer?a=v&amp;amp;q=cache:91N5yr86I8cJ:www.cs.binghamton.edu/~dima/cs333/knapsack.ppt+knapsack+greedy&amp;amp;hl=en&amp;amp;pid=bl&amp;amp;srcid=ADGEEShTnSJO_J8777gHwZ3NtuxNngAjKjL4cn8A_WJfdAf...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034770.aspx</link><pubDate>Wed, 22 Jun 2011 20:09:26 GMT</pubDate><guid isPermaLink="false">207139f86f0f41048f89186a4b6373d4</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Pa onda mi daj neki link normalni ,jer ga ja u nisam u stanju nać :/</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034690.aspx</link><pubDate>Wed, 22 Jun 2011 19:45:31 GMT</pubDate><guid isPermaLink="false">626e5b291870e559de8ffba97e6bf0cf</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Koliko se sjećam kad sam čitao o knapsack problemu, bio je tamo dokaz takav način ne daje dobre rezultate.&amp;nbsp;@autor teme: na internetu imaš sto objašnjena na engleskome o knapsack problemu. Malo se...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034650.aspx</link><pubDate>Wed, 22 Jun 2011 19:32:42 GMT</pubDate><guid isPermaLink="false">af9bdf6cbbfdde6e079d8d66f4697f4b</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>To sam i ja prvotno radio,ali to je greedy algoritam i ne prolazi :/</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034641.aspx</link><pubDate>Wed, 22 Jun 2011 19:29:30 GMT</pubDate><guid isPermaLink="false">fbf4f3ae149331ea6f69e983abdd908f</guid><category /></item><item><title>Re: Knapsack problem(dinamičko programiranje)</title><description>Uzmes za svaki predmet njegovu vrijednost i podjelis ju sa velicinom da dobijes odnos vrijednost/velicina, i nakon toga uzimas samo one predmete koji imaju najveci omjer.&amp;nbsp;Dakle sortiras te predme...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034513.aspx</link><pubDate>Wed, 22 Jun 2011 18:45:01 GMT</pubDate><guid isPermaLink="false">6d0f33105b13623844ae89bad9694efe</guid><category /></item><item><title>Knapsack problem(dinamičko programiranje)</title><description>Znam da dobar dio vas zna za ovaj problem,pa bih zamolio da mi netko napiše kod za njega,našao sam neko šugavo objašnjenje na engleskom,koje ne razumijem....Zadatak ide tako da lopov ima ruksak kapaci...</description><link>http://forum.bug.hr/forum/post/programiranje/knapsack-problemdinamicko-programiranje/2034448.aspx</link><pubDate>Wed, 22 Jun 2011 18:13:48 GMT</pubDate><guid isPermaLink="false">2fdd11c4c5e2b59eae28bcc54084bb75</guid><category /></item></channel></rss>