Landlords could no longer rely on rent-pricing software to quietly track each other's moves and push rents higher using confidential data, under a settlement between RealPage Inc. and federal ...

Determining the least expensive path for a new subway line underneath a metropolis like New York City is a colossal planning challenge—involving thousands of potential routes through hundreds of city ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Children as young as 4 years old are capable of finding efficient solutions to complex problems, such as independently inventing sorting algorithms developed by computer scientists. The scientists ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

There's a familiar TV discourse taking shape online right now, the kind that I suspect will look awfully familiar to you if you remember the way Game of Thrones crashed and burned in its eighth and ...

Google’s DeepMind research division claims its newest AI agent marks a significant step toward using the technology to tackle big problems in math and science. The system, known as AlphaEvolve, is ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Abstract: An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling ...

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks. For ...