Timeline for How is Dynamic programming different from Brute force
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 10, 2014 at 14:37 | comment | added | Raphael | @Izkata By that reasoning, every algorithm is "intelligent brute force" (which is an oxymoron, anyway). | |
| Apr 10, 2014 at 14:34 | comment | added | Izkata | @reinierpost Well, it tries to get there with intelligent, brute force, but then forgets to describe the "intelligent" part | |
| Apr 10, 2014 at 13:32 | answer | added | Tal | timeline score: -2 | |
| Apr 10, 2014 at 9:18 | comment | added | reinierpost | Your first quote doesn't define dynamic programming. | |
| Apr 10, 2014 at 6:42 | answer | added | nomen | timeline score: -2 | |
| Apr 9, 2014 at 22:41 | comment | added | Raphael | Related answer. | |
| Apr 9, 2014 at 22:36 | history | edited | Raphael | edited tags | |
| Apr 9, 2014 at 22:35 | answer | added | Raphael | timeline score: 17 | |
| Apr 9, 2014 at 17:12 | history | tweeted | twitter.com/#!/StackCompSci/status/453943544387235840 | ||
| Apr 9, 2014 at 16:52 | comment | added | Yuval Filmus | Traffic conditions are a red herring. You could consider them in any algorithm. | |
| Apr 9, 2014 at 16:51 | answer | added | Yuval Filmus | timeline score: 3 | |
| Apr 9, 2014 at 16:29 | answer | added | D.W.♦ | timeline score: 0 | |
| Apr 9, 2014 at 16:28 | answer | added | Tushar | timeline score: 9 | |
| Apr 9, 2014 at 15:58 | history | asked | Computernerd | CC BY-SA 3.0 |