Timeline for Clever caching of a recursively defined function
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2018 at 9:55 | comment | added | მამუკა ჯიბლაძე | It is now running for a while, and I noticed one problem, but I don't know whether it is solvable. As I said, values most frequently used for n are those for about one third of n. This means that when I erase the less used part of the cache, I am also losing values (those with m larger than one third of current n) which are going to be used more frequently later, when I reach larger n... | |
| Sep 21, 2018 at 3:48 | comment | added | მამუკა ჯიბლაძე | Excellent, thanks! One remark - I've already tried it, it works very well except when it comes to cutting cache down it slows down terribly. A way out seems to introduce one more parameter, cut amount, and when the size limit is reached, cut by that amount. I've tried it with limit one billion and cut one million, and it works much quicker this way. | |
| Sep 21, 2018 at 3:36 | vote | accept | მამუკა ჯიბლაძე | ||
| Sep 20, 2018 at 20:23 | history | answered | Szabolcs | CC BY-SA 4.0 |