Timeline for Which potential function does this algorithm minimize or maximize?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 27, 2013 at 1:43 | history | tweeted | twitter.com/#!/StackCompSci/status/405512108038975488 | ||
| Nov 26, 2013 at 16:29 | history | edited | shn | CC BY-SA 3.0 |
added 256 characters in body
|
| Nov 26, 2013 at 14:31 | comment | added | shn | @YuvalFilmus yes the question is why are there no cycles, how to prove that. | |
| Nov 26, 2013 at 11:01 | answer | added | Parham | timeline score: 3 | |
| Nov 26, 2013 at 9:49 | comment | added | Yuval Filmus | (Or rather: why are there no cycles.) Note that $A = \emptyset$ and $B = \emptyset$ are always local optima, so the algorithm probably doesn't minimize any global objective function. At most you stop at some local minimum. | |
| Nov 26, 2013 at 9:38 | comment | added | Yuval Filmus | So the question is: why does the algorithm converge? | |
| Nov 26, 2013 at 9:35 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
added 10 characters in body
|
| Nov 25, 2013 at 20:40 | history | asked | shn | CC BY-SA 3.0 |