sltkr

41 ms·

541.
by sltkr 12y ago
> Take a look here to see how Detroit has fared since 2008: http://goobingdetroit.tumblr.com/ Those are interesting photos, but how do we know whether they are representative of an overall trend? Those locations seem to
542.
by sltkr 12y ago
So what are the “crucial information and services” exactly that require gigabit internet access (Google Fiber's selling point, after all) today? Although “broadband” has always been a moving target, I think it is reasonable to say that
543.
by sltkr 12y ago
x32 is a great idea, but it was introduced too late (around 2012, I believe) and of course it is not widely used.
544.
by sltkr 12y ago
Then people notice that exec($_GET['foo']) doesn't work, but some smart cookie figures out that exec(untaint($_GET['foo'])) (or whatever the syntax is for removing the taint from an input variable) does, posts it on
545.
by sltkr 12y ago
I think "smallest number of instructions" is a pretty weird metric to use if you are going for "fast" solutions. checked_add_3() has a lot of instructions that can be executed in parallel. checked_add_4() has a lot of c
546.
by sltkr 12y ago
I see -- apparently it's common to call this "Prim's algorithm" even though it is more accurately described as a randomized variant of breadth/depth-first search. Thanks for clarifying that. I do still object to th
547.
by sltkr 12y ago
Yeah, I'm pretty sure the site you linked is wrong too, and I think the author doesn't realize it, because he says: > My last post was about using Kruskal’s algorithm to generate random mazes. This article is about using anoth
548.
by sltkr 12y ago
That code does NOT implement Prim's algorithm on a graph with randomly-weighted edges. Instead it just does a randomized breadth-first search of the area (starting from the corner), which is the same algorithm used for colouring, whic
549.
by sltkr 12y ago
> These methods are all unquestionably faster than the standard method, so would speed up the turnaround times, theoretically saving airlines money. That's assuming boarding is the bottleneck in the turnaround process. Is it?
550.
by sltkr 13y ago
To learn something new, you need to get out of your comfort zone, and try to get used to things that might seem "strange" or "unpleasant" at first. Just because the syntax looks odd at first glance, it doesn't mean
551.
by sltkr 13y ago
Sparse is fine if they are more-or-less randomly distributed.
552.
by sltkr 13y ago
Programmer's habits are possibly less reliable than requirements enforced by the compiler.
553.
by sltkr 13y ago
And "Transport Layer" should ring a bell to anyone familiar with the OSI model (for example, a student that has taken an introductory course on network protocols).
554.
by sltkr 13y ago
You're right -- my mistake. I missed that somehow.
555.
by sltkr 13y ago
No, but information on Wikipedia tends to be accurate and based on reliable sources -- when a person contradicts Wikipedia and fails to provide any sources of their own, they are usually wrong. Not necessarily, of course, but often enoug
556.
by sltkr 13y ago
This is a cute story, but it lacks all sources, and it contradicts Wikipedia [1] [2]: > Commonly repeated lore has it that August has 31 days because Augustus wanted his month to match the length of Julius Caesar's July, but this is
557.
by sltkr 13y ago
It's more like: breadth-first search is a specialization of Dijkstra's algorithm, which is a specialization of A*.
558.
by sltkr 13y ago
Original original article: http://www.politie.nl/nieuws/2014/april/2/08-ilegale-bitcoin...
559.
by sltkr 13y ago
Seems like a great application for Monte Carlo tree search.
560.
by sltkr 13y ago
> [..] douches [..] paying huge sums of money for crappy apartments, not even because they want to live there, but because they enjoy bullying the poors. I find this very hard to believe.
561.
2048 in PuzzleScript(puzzlescript.net)
1 points by sltkr 13y ago|0 comments
562.
by sltkr 13y ago
Costly in what sense? Compilation time? Binary size?
563.
by sltkr 13y ago
> Clang begs to differ on that point http://clang.llvm.org/cxx_status.html Impressive! I see that exported templates got scrapped in the latest standard -- they probably never supported that. In any case, my point wasn&
564.
by sltkr 13y ago
A more recent version is here: http://www.elizium.nu/scripts/lemmings/ And a write-up from the original author here: http://crisp.tweakblogs.net/blog/3881/dhtml-lemmings-primer.... (IIRC
565.
by sltkr 13y ago
They haven't -- the cleanup label is still there. They added a `fail` label which explicitly sets the result variable to 0.
566.
by sltkr 13y ago
I think that's a bit dishonest -- the standard is almost entirely supported by GCC: http://gcc.gnu.org/c99status.html > C99 is substantially completely supported as of GCC 4.5 (with -std=c99 -pedantic-errors used),
567.
by sltkr 13y ago
But that article concludes that “the Negro” is NOT inferior: > I have tried to review briefly the important fields in which evidence of Negro inferiority is most likely to be found, if found at all. In no case is the proof conspicuous by
568.
by sltkr 13y ago
I can't think of a more relevant situation to apply Hanlon's razor. edit : Deleted comment suggested MtGox was manipulating the market intentionally, to benefit from the price drop.
569.
by sltkr 13y ago
It sounds like an annoying limitation of the API that (apparently?) you can't cheaply validate whether a bucket exists. Two manual work-arounds that come to mind: - store a list of created buckets as keys in another bucket. - store a d
570.
by sltkr 13y ago
Even shorter: (and much faster!) shuf -n 4 /usr/share/dict/words Somewhat more seriously, Diceware works pretty well too as a low-tech, high-quality password generation method: http://world.std.c

More ›