Research team debuts the first deterministic streaming algorithms for non-monotone submodular maximization, delivering superior approximation ratios with minimal memory and real-time throughput on ...
Abstract: We present fully polynomial approximation algorithm for generalized maximum concurrent flow problem with budget constraint that run in time independent of the number of commodities k. We ...
(a) Performance of two adiabatic paths for finding the maximum independent set. (b) Performance of traditional heuristic adiabatic paths for finding independent sets. Quantum annealing, as a prominent ...
1 Tianjin Engineering Research Center of Civil Aviation Energy Environment and Green Development, Civil Aviation University of China, Tianjin, China. 2 Groupe d’Acoustigue de l’ Université de ...
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 ...
AlphaEvolve uses large language models to find new algorithms that outperform the best human-made solutions for data center management, chip design, and more. Google DeepMind has once again used large ...
Abstract: In applied and numerical algebraic geometry, many problems are reduced to computing an approximation to a real algebraic curve. In order to elevate the results of such a computation to the ...
Right now, quantum computers are small and error-prone compared to where they’ll likely be in a few years. Even within those limitations, however, there have been regular claims that the hardware can ...
Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback