mzl

11 ms·

121.
by mzl 3y ago
The article links to the Unison project, which does optimal spilling and register allocation using constraint programming solvers. The core idea is that memory for spilling is treated as an additional set of register-like locations, with co
122.
Binary Magic: Building BitNet 1.58bit Using PyTorch from Scratch(medium.com)
1 points by mzl 3y ago|0 comments
123.
by mzl 3y ago
You could perhaps adapt the Doppel Bot slack bot from Modal Labs: https://github.com/modal-labs/doppel-bot
124.
by mzl 3y ago
Small side note, standard MCTS is often implemented with heuristic guiding the moves in the playouts and not just random moves, as that gives more interesting information.
125.
SambaNova Says Its First with Trillion-Parameter GenAI Model(insidehpc.com)
2 points by mzl 3y ago|1 comments
126.
by mzl 3y ago
The original paper ( https://arxiv.org/pdf/2303.14605.pdf ) that the linked article reports on is a theoretical algorithms paper, and does not contain any references to actual solvers or implementations. For practical ca
127.
by mzl 3y ago
Lowering the algorithmic upper bound for a core NP-complete problem is always extremely interesting. However, this is not necessarily related to improving runtime for practical implementations solving the problem in question. Solvers for m
128.
by mzl 3y ago
Just saw that it looks like an upcoming release of OR-Tools might include reified tables: https://github.com/google/or-tools/commit/94f3d9b46870e7ea04...
129.
by mzl 3y ago
The key point for all of MDD, smart table, compressed tables, the case constraint, and regular expression and finite automata constraints is the ability to compress don't-care information, which essentially gives one reification for a
130.
by mzl 3y ago
Thanks for the link. I think that your version of getting to a reified extensional constraint (your table method) looks like a reasonable way to do it, and probably works quite well for OR-Tools CP-SAT in particular. Another way to do it di
131.
by mzl 3y ago
What model did you end up using? And what system did you do it in? My immediate guess on how to model it would be to create reified constraints for the wordlists of different lengths (the constraints in chapter 22 of https://www.
132.
by mzl 3y ago
I realized that there is more to do in handling the team positions. Since the number of each position is fixed, the whole array of team_position can be replaced with a fixed set of integers. With that change, it is also possible to add symm
133.
by mzl 3y ago
Interesting model! Testing it locally, I could see that one issue in the model is that there is a lot of symmetry to the results. Enforcing that players in the team are ordered was not useful and did not help. Enforcing that the team positi
134.
by mzl 3y ago
See chapter 17 in https://www.gecode.org/doc-latest/MPG.pdf for a description on how to solve it with regular expression constraints using CP.
135.
by mzl 4y ago
> There are HFT systems using Java, few were on HN even. The HFT systems I know about in Java are mostly not recognizable as Java to most Java programmers. They use static allocation of all data making sure that there is no risk of a GC
136.
by mzl 4y ago
Thanks, and nice to see! Even if 10 seconds is often fast enough for solving a problem, I can imagine that it would be good to get down. From the code I guess that you use Chuffed, have you also tested other solvers? OR-Tools with parallel
137.
by mzl 4y ago
VIBES seems like a very cool project. Do you have any example MiniZinc files that show how the generated problems look? Also, I would encourage you to generate some interesting instances and submit to the MiniZinc challenge (last years call
138.
by mzl 4y ago
I'm curious what you would have wanted MiniZinc to do? In general, I think MiniZinc is great precisely because it is a structured way to generate a list of constraints, since this makes it possible to integrate into a variety of solver
139.
by mzl 4y ago
It depends a lot on the problem to solve and how it is modeled. For some things OR-tools and/or other CP-style solvers are clearly better than MIP solvers. For others, vice verse. A really nice thing with MiniZinc is that the same mode
140.
by mzl 4y ago
Most constraint programming applications are written in traditional imperative languages using solver libraries like OR-Tools, Gecode, IBM CP Optimizer, and others. This is both because that works best in the larger context of most applicat
141.
by mzl 4y ago
As understood it, finding a solution that satisfies all the constraints is not trivial, and for that external libraries are the right kind of tool.
142.
by mzl 4y ago
As others have said, using a combinatorial solver like Z3 (SMT solver) or MiniZinc (which is a modelling language and can interface to different types of solvers, including several constraint programming and mixed integer programming solver
143.
by mzl 5y ago
Sounds like you have a good solution for your problem. Whatever solves the problem and is already done is naturally a good solution! From my experience, the most important thing to get right in any local search algorithm is the state repres
144.
by mzl 5y ago
Not OP either, but there are many different aspects to solvers that make them useful in different situations. For example, I would perhaps not use the same solver for a best-effort problem where I can program strong heuristics, vs a problem
145.
by mzl 5y ago
Fun problem. When solving with Gecode, you might want to add the annotation `:: domain_propagation` to the `all_different` constraint ( https://www.minizinc.org/doc-2.6.2/en/lib-stdlib-annotations... ). Sometimes a
146.
by mzl 5y ago
I use different solvers for different things, depending on the type of problem to solve and the goal of solving the problem. * MiniZinc is my favourite tool for prototyping models. Looking into the feasibility of using it in a roduction env
147.
by mzl 5y ago
As noted very clearly in the article, the problem with using underspecified versions of C as the ABI is _also_ a problem for C the language, as it limits the possible evolution of C.
148.
by mzl 5y ago
I agree with the recommendation to start with a modelling language in a sibling comment. On the MiniZinc homepage, there are Coursera courses linked that are quite nice as an introduction into combinatorial modelling. Apart from that, it is
149.
by mzl 5y ago
And similarly relevant, using a solver independent modelling language like [MiniZinc]( https://www.minizinc.org/ ) means that it is possible to write a model, and then translate it formats suitable for use with MIP, CP, and S
150.
by mzl 5y ago
I've previously written a model that generates sets of non-transitive dice using MiniZinc. It can be seen in this Gist: https://gist.github.com/zayenz/4fa2d5ca8f96f7ce939275be25bdd...

More ›