mzl

28 ms·

301.
by mzl 13y ago
N-queens, while quite a cute problem, is typically not that interesting as a constraint programming benchmark. The way to make it fast is to have a bit-set representation of the domains, which is not the best representation for many other i
302.
by mzl 13y ago
No problem. It was one of my pet peeves when others (typically physicists) devalued the work of the computer scientists at the university I was at just because they believed that journals were the only acceptable form of publishing.
303.
by mzl 13y ago
Sorry, I was too general. I am very much aware that there are selective workshops in CS (I've been to some). I think I mostly wanted to point out some differences. My main wish was to convey that publishing venues are different, and th
304.
by mzl 13y ago
In many CS fields, workshops are the equivalent of conferences in other fields such as physics. It is important to judge each field on how the primary peer-review publication is done, not by some abstract rule that is supposed to be the onl
305.
by mzl 13y ago
AFAIK, the Spotify desktop app throttles the amount of upload so that it shouldn't disturb the user (or at least, it used to do that). If it used up all my upload bandwidth, I would consider that a bug and file a report.
306.
by mzl 13y ago
From the article: "We have removed these caps completely across all platforms"
307.
by mzl 13y ago
Ok, I agree that it can be interesting for some cases, but it is not at all what people expect when they hear "quantum computer". In addition, the comparisons with traditional methods for solving that problem show that you may as
308.
by mzl 13y ago
The "quantum computer" is a good marketing gimmick, but the problem it solves is fairly uninteresting. See http://www.scottaaronson.com/blog/?p=1400 for some critical discussion of the D-Wave machine.
309.
by mzl 13y ago
Set comprehension is a standard mathematical term ( http://en.wikipedia.org/wiki/Set-builder_notation ). List comprehension is a fairly natural name given that.
310.
by mzl 13y ago
While I have no knowledge of whether or not Clojure programmers are more productive, a recently linked mail from Joe Armstrong on Erlang productivity was quite interesting: https://groups.google.com/forum/#!msg/erl
311.
by mzl 13y ago
CPS is short for continuation passing style ( http://en.wikipedia.org/wiki/Continuation-passing_style ).
312.
by mzl 13y ago
Another one of these quirks is ground white pepper, which for some people (myself included) quite often smells strongly of fecal matter. The reason seems to be extra sensitivity to a compound aplty named Skatole. Naturally, this is quite an
313.
by mzl 13y ago
Just fyi, that was the point in the argument. :-)
314.
by mzl 13y ago
Now with the final results.
315.
ACM ICPC 2013 World Finals Live Standings (with link to online judge)(static.kattis.com)
1 points by mzl 13y ago|1 comments
316.
by mzl 13y ago
I have the exact same use-case: big hierarchy of feeds, and just reading the ones I feel like at the moment. I switched to Newsblur, and apart from some small issues with the UI (which is getting better), I've been really happy. The iO
317.
by mzl 13y ago
Yes, because lowercase ASCII does not meaningfully capture how names are written in most of the world. If you want to cater to a global audience, it is simply not sufficient.
318.
by mzl 13y ago
While Java does have finalizers, there is no guarantee that they will run. In other words, a valid implementation could just skip running them at all.
319.
by mzl 13y ago
I have no idea if it is possible to use Minizinc models with CP Optimizer, but I would guess not. It doesn't feel like a feature that would be of business interest to IBM to develop. As for Håkans pages, http://www.hakank.org/common_cp_mod
320.
by mzl 13y ago
Note that CPLEX and CP Optimizer are two completely different products. AFAIK, a license key for one of them can not be used for the other. But I've never actually used either myself, so don't take my word for it. Also, since you seem to be
321.
by mzl 13y ago
One of the driving forces behind the development of Gecode was that academics used to use the pre-cursor to IBM CP Optimizer, ILOG Solver, in research. As for comparing Gecode with CP Optimizer, the largest difference IBM CP Optimizer is a
322.
by mzl 13y ago
> The solver itself is generally dumb. It will propagate some constraints sensibly but mostly it will just search over the entire space - equal to the size of the domain to the power of the number of variables This is false. The corners
323.
by mzl 13y ago
Propagation power really depends on the problem. For some problems, propagation is amazingly good, and for some it does not do much at all. One can characterize propagation algorithms for the amount of propagation they do. A domain consiste
324.
by mzl 13y ago
Another interesting code breaker during WWII was the Swede Arne Beurling ( https://en.wikipedia.org/wiki/Arne_Beurling ). He reverse-engineered the Sturgeon cipher from intercepted enrypted texts using pen and paper only, enabling Sweden to
325.
by mzl 13y ago
In a question about this on programmers.se, a slightly different history of the "Single Entry, Single Return" mantra is presented: http://programmers.stackexchange.com/a/118793/4025 Essentially, it is argued that the practice that is warn
326.
by mzl 14y ago
When merging a rebased feature branch, make sure to use merge --no-ff so that a merge commit is introduced even though fast forwarding could be done.
327.
by mzl 14y ago
Well, of course the logic notation in question is used in mostly in logic contexts. In the same manner, as a student of logic I will not come across special notation from analysis. Although I am not working in that area any more, when I use
328.
by mzl 14y ago
Is really sequent calculus ( http://en.wikipedia.org/wiki/Sequent_calculus ) that odd, that you never encountered it in your math studies? I personally find it quite easy to read, with nicely structured proofs.
329.
by mzl 14y ago
I'm wondering if "slightly less intuitive" is a deliberate understatement or not :) I recently read through the concurrent skip list map implementation in Java that is lockless. That code is definitely quite tricky, and the comments refer t
330.
by mzl 14y ago
While it might take some time to solve your particular problem, similar problems have been solved previously. Take a look at the hello and erase programs at http://www.mathstat.dal.ca/~selinger/md5collision/ for a nice example of construc

More ›