Chio

7 ms·

1.
by Chio 1y ago
I can't share pricing details since they are confidential but if you just want to play with MIP you don't need to buy one of the big three (XPRESS, Gurobi, CPLEX) which are all very expensive but usually available for free for stu
2.
by Chio 2y ago
We kind-of have that in DeepSeek-R1-zero [1], but it has problem. From the original authors: > With RL, DeepSeek-R1-Zero naturally emerged with numerous powerful and interesting reasoning behaviors. However, DeepSeek-R1-Zero encounters c
3.
by Chio 3y ago
From a quick survey of the implementation probably not very well since, for example, it is using dynamic dispatching for all distance calculations and there are a lot of allocations in the hot-path. Maybe it would be better to post this rep
4.
by Chio 3y ago
This is true, but there is HiGHS [1] which is "good enough" to use for a lot of real problems (though the commercial solvers are still better). [1] https://highs.dev/
5.
by Chio 3y ago
Happy new year! Committed to making this new year my, and your, best year so far! Thanks for being a great community.
6.
by Chio 4y ago
The "autofree" memory management [1] seems quite interesting, and a very cool mixture between garbage collection with static memory management. Has been there been any seminar / conference talk held on this topic related to t
7.
by Chio 4y ago
This is an interesting lawsuit as it is a *company* seeking damages due to DMCA abuse by a third party, and my understanding is that this is very widespread (no source sorry). Is anyone aware of any studies done on the total cost¹ (vs benef
8.
by Chio 4y ago
I don't believe this is how it is actually implemented in _most_ companies. Where I work every PR must have a linked story / bug / etc but anyone has the rights to create a story so it acts more as a way to track what chang
9.
by Chio 4y ago
I've taken the opposite approach a lot of times. So instead of asking what you can add you might want to look at what apps / bookmarks that you can remove. Do you need a link to the reddit frontpage, or can you narrow it down to o
10.
by Chio 4y ago
This reminds me of an old paper [1] that discuss the performance characteristics of different array layouts for searching in particular. The conclusion is heavily based on the number of cache misses and branch predictor misses that binary s
11.
by Chio 4y ago
I agree wholeheartedly on your points regarding async, which is a topic I've tried to avoid so far in all of my Rust projects because of all the reasons you've already raised above and you really don't need it for most use-ca
12.
by Chio 4y ago
To add my own few cents to this very common discussion Rust is hard is the same way that most programming languages that rely "non-standard" paradigms are hard because they challenge your current mental model of programming. Howev