Newswise — A framework based on advanced AI techniques can solve complex, computationally intensive problems faster and in a more more scalable way than state-of-the-art methods, according to a study ...

Bicycle sharing systems have become an attractive option to alleviate traffic in congested cities. However, rebalancing the number of bikes at each port as time passes is essential, and finding the ...

The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...

Researchers at the University of Gothenburg have developed a novel Ising machine that utilizes surface acoustic waves as an effective carrier of dense information flow. This approach enables fast, ...

Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue, researchers ...

Variational quantum algorithms (VQAs) are constrained by a trade-off: deeper circuits can cover a larger reachable quantum states but suffer from barren plateaus, while shallow circuits remain ...

A new adaptive Lévy flight–based wolf pack algorithm significantly outperforms ten competing metaheuristics on 300 multi-UAV ...

Researchers at Nanyang Technological University, Singapore (NTU Singapore) have developed an artificial intelligence (AI) ...

Some computing problems become difficult not because any individual calculation is particularly complicated, but because ...

The proposed algorithm combines variational scheduling with post-processing to achieve near-optimal solutions to combinatorial optimization problems with constraints within the operation time of ...