mzl

15 ms·

181.
by mzl 7y ago
Out of curiosity, how would you say that relational algebra and algebraic semirings help you with constraint programming? While that can indeed be useful in some cases when doing research in constraint programming, I am curious how it helps
182.
by mzl 7y ago
That is about right. What happens at -O4 is that for every variable, the upper and lower bounds are tested, and if using the bound as the value for the variable would make the problem unsolvable, then that bound is discarded. For some probl
183.
by mzl 8y ago
The Rust plug-in, is already quite nice, and getting better all the time. I use it from CLion, since that has integrated debuging support.
184.
by mzl 8y ago
I'm not implying that Rust should have these yet; I am fully aware that the situation for Java is different due to serious and long efforts in developing great refactoring tools. The point I was trying to make is that the view that Rus
185.
by mzl 8y ago
For Rust development I use CLion with the Rust plugin, and it is getting better and better all the time. It is interesting seeing the difference in peoples expectations on what an IDE can and should be able to do for you depending on what t
186.
by mzl 8y ago
> refactoring of large Rust codebases is a breeze: change the portion of code you care about, follow the compiler's complaints At my $DAYJOB I write a lot of Java, and modern full-featured IDE's for Java like IntelliJ are absol
187.
Why software projects take longer than you think – a statistical model(erikbern.com)
700 points by mzl 8y ago|317 comments
188.
by mzl 8y ago
What you describe falls under the general umbrella term of combinatorial optimization, of which Constraint Programming, Mixed Integer Programming, SAT, SMT, and local search techniques can be said to fall under. Personally, I find the langu
189.
by mzl 8y ago
I really like the post, except for the conflation of brute force search and using recomputation as state restoration. In my opinion, a brute force search algorithm is an algorithm that will explore the whole search space without any intelli
190.
by mzl 8y ago
Personallly, I don't think so. As far as I've seen, most of the time, a CP-system implemented as a library would be used.
191.
by mzl 8y ago
Sometimes I get to use constraint programming (CP) at $DAYJOB. For prototying solutions, the MiniZinc language is nice to use, since it is a language for modelling combinatorial optimization problems. To use a CP solution in an actual produ
192.
The hacker's guide to uncertainty estimates(erikbern.com)
248 points by mzl 8y ago|11 comments
193.
Constraint Solving with MiniZinc(hillelwayne.com)
118 points by mzl 8y ago|38 comments
194.
Constraint Solving with MiniZinc(hillelwayne.com)
3 points by mzl 8y ago|0 comments
195.
by mzl 8y ago
Thanks! It would really be interesting to see how AlphaZero style game play would work out. In particular, the very wide branching factor (when accounting for stochasticity) and relatively shallow game tree might change the characteristics
196.
by mzl 8y ago
It's a really fun little game! The follow-up game, Queendomino, introduces more game-play mechanics and a greater amount of interaction and strategic choices, making it more of a gamers game. I like them both, and it depends on the moo
197.
Monte Carlo Methods for the Game Kingdomino(zayenz.se)
47 points by mzl 8y ago|6 comments
198.
Unison: register allocation, instruction scheduling using constraint programming(unison-code.github.io)
2 points by mzl 8y ago|0 comments
199.
Monte Carlo Methods for the Game Kingdomino(zayenz.se)
2 points by mzl 8y ago|0 comments
200.
by mzl 8y ago
A real IQ test (i.e., WAIS-IV or similar) is a lot more than just a few short problems, it takes several hours and is done one on one with a trained psychologist. The test used by Mensa (as an example many think about when they hear IQ test
201.
by mzl 8y ago
The paper claims NP-completeness AFAICS, so I thought that was what you meant. Sorry if I misunderstood. There are problems that have approximations that can get arbitrarily close to the optimum. One particularly interesting case IMHO are s
202.
by mzl 8y ago
The concept of NP-complete is different form the concept of np-hard to approximate in any way. The question if a particular problem is hard to approximate is typically a diverse and interesting research area, that does not have obvious answ
203.
by mzl 8y ago
There are exclusions, but they are only available for the current module: > Exclusions only apply to builds of the current module. If the current module were required by a larger build, the exclusions would not apply. https://
204.
by mzl 8y ago
For vgo there is an explicit goal is to avoid NP-completeness for some reason. Systems of not-equals are NP-hard (trivially models 3-colouring), so allowing not-equals constraints on package versions is a non-starter if the stated goals of
205.
by mzl 8y ago
And crucially, in these systems you are given an escape hatch (declaring versions that are not ok), which vgo does not support.
206.
by mzl 8y ago
> As an analogy, consider the average numerical computer program. We often derive the underlying math in terms of real-valued vector spaces. However, when implementing the program on a computer system, all variables are ultimately discre
207.
Interviewing is a noisy prediction problem(erikbern.com)
2 points by mzl 8y ago|0 comments
208.
Waiting time, load factor, and queueing theory(erikbern.com)
1 points by mzl 9y ago|0 comments
209.
by mzl 9y ago
For me, it is not about catching errors, it is about documentation. In the codebase I work on most, all variables that can be marked final are marked final. That means that whenever I see a non-final variable, I know that something tricky i
210.
by mzl 9y ago
You might also be interested in looking at MiniZinc ( http://minizinc.org/ ). It is mostly used int the constraint programming community, but the language is solver technology neutral and there are back-ends that translate to

More ›