ashdnazg

6 ms·

61.
by ashdnazg 3y ago
Package name should have been Lattex.
62.
by ashdnazg 3y ago
Interesting article! Regarding the low core-count, you might actually lose performance when having less CGUs, since your absolute estimation error is larger. For example if a CGU can take 3 times as long to compile as another with the same
63.
by ashdnazg 3y ago
I was indeed talking about the implementation and the algorithm as described in the article (prior to the recent edit updating the definition of L). That Shamir's algorithm is correct was never in question.
64.
by ashdnazg 3y ago
At the moment the algorithm seems to only check for exactly 20 move solutions, so it won't find them easily. You would however find the optimal solution followed by some silly back and forth that can be identified, as long as the optim
65.
by ashdnazg 3y ago
If I'm not mistaken, this algorithm doesn't result in an optimal solution. You can see that in the example in the end, a random cube resulted in a 20 move solution, which is the upper bound for any solution [0]. There are not many
66.
by ashdnazg 3y ago
I think you mean this: https://en.m.wikipedia.org/wiki/Kurt_von_Hammerstein-Equord#... ?
67.
by ashdnazg 4y ago
I've used Bloom filters in a Battlecode [1] AI. We had a shared array where reads and writes are expensive, so a bloom filter was used in order to not waste time on writing something that's already written there. [1] https:/
68.
by ashdnazg 4y ago
https://www.timesofisrael.com/hebrew-university-to-open-acad... From 2016 - "The university is mired in debt amounting to nearly NIS 13 billion ($3.4 billion) over employees’ pensions."
69.
Finding Binary and Decimal Palindromes(ashdnazg.github.io)
2 points by ashdnazg 4y ago|0 comments