Timeline for Reordering algorithm to fragment consecutive sequences of ones as much as possible
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9 at 18:21 | comment | added | caduk | Ah, yeah, sorry, I will think about it | |
| Apr 9 at 18:10 | comment | added | Thedby | This is a very nice idea, but it seems to me that your are only minimizing the maximum length, I'm not sure how to proceed to obtain an optimal sequence in this way. Thank you for your answer. | |
| Apr 9 at 16:54 | history | answered | caduk | CC BY-SA 4.0 |