sonoffett

13 ms·

91.
by sonoffett 16y ago
If this were the situation I would agree with you, however an independent programmer has implemented his algorithm and posted it on github with instructions ( https://github.com/anjlab/sat3 ) on how to run it on k-SAT instances. Because of
92.
by sonoffett 16y ago
Yes, higher is better because it gives you a tighter bound when searching for Big-Theta: ie. if your algorithm is in O(2^n) and the previous lower bound was Omega(n^2), and someone proves a lower bound of Omega(2^n) then you know the proble
93.
by sonoffett 16y ago
I'm pretty sure your second definition is an upper bound (big-O) and the first definition is a lower bound (big-Omega). EDIT: adding a link to the wikipedia article defining Big-O and Big-Omega: http://en.wikipedia.org/wiki/Big_O_notation
94.
by sonoffett 16y ago
Coffee in the mornings, I've started mixing a pinch of mate to add some extra flavor. Alcohol of choice is russian river's pliny the elder if I can find it--or stone brewery's russian imperial stout.
95.
by sonoffett 16y ago
I've also seen this named "ssl offloading" and anecdotally I found responsiveness to greatly increase on my zimbra webmail server once I placed an nginx web proxy ahead of it just to do decryption (this wasn't through AWS).
96.
by sonoffett 16y ago
the angry mob demanding the end to all patents championing the protection of small inventors is noticeably silent
97.
by sonoffett 17y ago
I have found it very useful when writing unit tests for a particular method. I don't have to instantiate the class for which the method is a member of; instead I can easily pass a mock object as self that only contains the properties the me
98.
by sonoffett 17y ago
one possible solution is the one Mozilla Bespin went with where there's a hovering translucent scroll bar which varies in opacity depending on whether you're hovered over it.