stncls

5 ms·

1.
by stncls 5d ago
When Google stopped paid API search a few months ago, I looked for an alternative for my agents that I felt would be sustainable (one-time setup, then out of my mind). I quickly excluded SERP as I feard Google would pull exactly this type o
2.
by stncls 3mo ago
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 good.
3.
by stncls 9mo ago
> 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 is not a single JMP instruction. Instead, CALL <immed
4.
by stncls 1y ago
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 well. All had 4-15hr batteries, more than I
5.
by stncls 1y ago
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] https://timefold.ai/blog/optapl
6.
by stncls 1y ago
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 simplex method have been proven to take exponential
7.
by stncls 1y ago
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) to be 60x faster [1]. By the same measure, the best open sou
8.
by stncls 2y ago
> 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 lattices. We don’t technically know whether these are NP-comp
9.
by stncls 2y ago
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-2008 standard: > A conforming function shall return results
10.
I built an AI company to save my open source project(timefold.ai)
14 points by stncls 2y ago|1 comments
11.
by stncls 2y ago
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 is: > Therefore, I naturally omit the use and configu
12.
by stncls 2y ago
> 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 computationally hard problem with near-optimal solutions. > Thi
13.
Experience writing combinatorics paper in collaboration with LLMs (see Appendix)(arxiv.org)
2 points by stncls 2y ago|0 comments
14.
by stncls 2y ago
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 distros (current Fedoras), plain admission that no attempt was
15.
by stncls 2y ago
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 are all end-of-life (since December 2023 in the case o
16.
by stncls 2y ago
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 solve the problem once the LLM gives you a formulation? Or is
17.
by stncls 2y ago
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 matters? Yeah, sure, I can believe that swap makes sense. O
18.
Open Source Maintenance(anteru.net)
1 points by stncls 2y ago|0 comments
19.
by stncls 2y ago
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 rather than something a computer would do.
20.
Video ad for World Hearing Day has clear GenAI artifacts [video](youtube.com)
2 points by stncls 2y ago|1 comments
21.
by stncls 3y ago
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 load to arrive. Typically, those would be sequential algorith
22.
by stncls 3y ago
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 others have mentioned here (cars, mass housing, garbage c
23.
by stncls 3y ago
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 happen, although the really big ones are 25+ yea
24.
Solver Performance: 1989 vs. 2024(solvermax.com)
146 points by stncls 3y ago|83 comments
25.
by stncls 3y ago
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 called "TimeFold", most development happens there
26.
by stncls 3y ago
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 optimality back in 2006: https://www.math.uwaterloo.
27.
by stncls 3y ago
What do you mean by optimization engine? Did you write a solver yourself, or did you use something off-the-shelf? In either case, what are the algorithms involved?
28.
by stncls 3y ago
Do you have a writeup about the optimization methods you used? I mean, which algorithms did you choose?
29.
by stncls 3y ago
Solving this problem to optimality (for whatever constraints and objective function one is interested in -- a precise formulation was not given by the O.P.) is presumably NP-hard indeed, meaning that the computational cost grows exponential
30.
by stncls 3y ago
Yes, a step in the right direction for C2x, thank you for that.

More ›