Viewing profile — stncls

Oh even if your org has a subscription, the fees are insane. You just don't see them. Things are slowly changing but I can't wait for this parasitic business model to collapse for …

> The simplest solution however is to use -mcmodel=large which changes all the relative CALL instructions to absolute JMP. Makes sense, but in the assembly output just after, there…

I don't know about "best", but I'm very happy with my last few Lenovo ThinkPads (X1 carbon, nano, some T-series). Before that, I had some Asus Zenbook, and everything worked as wel…

A good chunk of the day-to-day work of "operations research" consulting shops is scheduling. There is also dedicated software like Timefold, formerly RedHat OptaPlanner [0]. [0] ht…

You're right, but it's very subtle and complicated. In theory, the simplex method is not known to be polynomial-time, and it is likely that indeed it is not. Some variants of the s…

If this is business critical for you, you may want to switch to a faster solver. Glop is very nice, but it would be reasonable to expect a commercial solver (Gurobi, XPress, COpt) …

> Instead, cryptography needs problems that are hard in the average case, like the RSA problem, the discrete logarithm for elliptic curves, and the shortest vector problem for latt…

Floating-point is hard, and standards seem like they cater to lawyers rather than devs. But a few things are slightly misleading in the post. 1. It correctly quotes the IEEE754-200…

I'm ready to believe that pipewire is imperfect (although I have personally experienced no crash, and did not have to configure anything), but the sentence from the original post i…

> Complexity > We present a polynomial-time algorithm achieving an approximation ratio below √2 for MVC, providing strong evidence that P = NP by efficiently solving a computationa…

No vulnerability name, no website, concise description, neutral tone, precise list of affected distros (RHEL + derivatives and some EOL Fedoras) and even mention of unaffected dist…

Yes, only RHEL 9 (the current version of RHEL) and its upstreams/downstreams (CentOS Stream 9, Rocky Linux 9, Alma Linux 9,...). Also affected: Fedora 37, 36 and possibly 35, which…

So the AI part is because the customers state their problem in plain English? In your experience, do they prefer that rather than a GUI? Incidentally, what method do you use to sol…

The article is from 2018 and has had interesting discussion here before [1]. My conclusion is: In production, in a datacenter, when code is stable and compute-per-dollar efficiency…

The music is off as well (second half of piece, I can't quite put my finger on it... Brass section may be out of tune?), but that part sounds more like a poor rendition by humans r…

In many cases yes. Some single-threaded workloads are very sensitive to e.g. memory latency. They end up spending most of their time with the CPU waiting on a cache-missed memory l…

Tap water. I can't stop marveling at the fact that we have (mostly) unlimited, clean, drinkable water on demand and virtually for free. But also many other things, many of which ot…

I would answer "yes" to all your questions. > Was there a major theoretical development in the solver field that allowed this to happen ? A few major theoretical developments did h…

This is precisely what optaplanner was designed to do. Note the optaplanner has been forked by its original author and main contributor when they left RedHat/IBM. The fork is calle…

I agree with grandparent that non-optimal solutions are often enough. But just to be complete, since TSP was mentioned here: We could solve TSP instances with >80k cities to optima…