Gorgonia VS or-tools

GitHub - gorgonia/gorgonia: Gorgonia is a library that helps facilitate machine learning in Go.

I did end up writing and using a custom library for Random Forest (it's also in AwesomGo) in one real-world project (detecting Alzheimer's and Parkinson's from speech from a mobile app) - https://github.com/malaschitz/randomForest I had better results than the team who used TensorFlow and most importantly I didn't have to use any other technology than Go. For NN's it's probably best to use https://gorgonia.org/ - but it's not exactly a user friendly library. But there is a whole book on it - Hands-On Deep Learning with Go.

Perhaps it's a product of French culture, but because Gorgonia[0] has a number of French contributors, this was actually the way we structured our documentation.

But this is the first time I've heard of the name of the framework.

[0]: https://gorgonia.org

Oh it's.Gorgonia

Website: https://gorgonia.org

I use Gorgonia.

What you think about this https://github.com/gorgonia/gorgonia ? I also recall there is something else out there but can't find it at the moment...

Yep, all of them: https://github.com/gorgonia/gorgonia

Small NP-hard problems aren't actually that bad. You can usually formulate them as eg a integer programming problem or a SMT problem, and throw an off-the-shelf solver at them.

You only need to learn the solver once, and you can re-use it for all kinds of problems. (Assuming that your instances don't have to be solved with low latency. Eg only as part of your level generation process, or at most when loading a randomly generated level, but not every frame or so.)

https://developers.google.com/optimization has a decent collection of tools.

Just saw that it looks like an upcoming release of OR-Tools might include reified tables: https://github.com/google/or-tools/commit/94f3d9b46870e7ea04...

Google OR - Tried to represent a solution to be a 5 dimensional matrix with an hour granularity. Dimensions are stations, program, project manager, day and time. If matrix[station][program][project manager][day][time] = 1, then that set is assigned, otherwise not. The main issue encountered here is about time slots, as they are not necessarily on a per hour basis. We tried time slots to be in a 5-minute interval. However, constructing the constraints that would adhere to each programs duration was proven to be difficult.

If you are just interested in getting a solution or for having a reference solver: There is a sudoku example in the OR-Tools package that uses constraint programming.

Not sql, but check out google’s OR-Tools. Hardly ever gets mentioned but looks very capable for some applications. https://developers.google.com/optimization

Then there's also the Google's solution: https://developers.google.com/optimization/

start enumerating the properties you think the solution to your problem should have. once you have this, you should be able to reformulate those properties as constraints and then you can just plug this into a combinatorial solver such as https://developers.google.com/optimization