News
Caltech scientists have found a fast and efficient way to add up large numbers of Feynman diagrams, the simple drawings ...
The MPC-based STADP (MSTADP) algorithm employs neural networks (NNs) to construct three key modules: the model module, the critic module, and the action module. These modules enable the identification ...
A new switching control algorithm based on state trajectory approximation is proposed to regulate the output voltage of a representative second-order DC-DC converter - the boost converter. The essence ...
Modern Instrumentation Volume 2, Issue 1 (January 2013) ISSN Print: 2165-9257 ISSN Online: 2165-9273 Citations ...
Once refined, the new algorithm could potentially be applied to a number of applications, including internet data, airline scheduling and improving the efficiencies of markets, the researchers said.
A team of researchers led by Rasmus Kinn of the Swiss Federal Institute of Technology in Zurich has created a near-perfect algorithm to calculate the maximum transport flows at the lowest cost in ...
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024 DOI ...
In brief Computer scientists at ETH Zurich have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with ...
June 5, 2024 — In a new paper in Science Advances on May 29, researchers at JPMorgan Chase, the U.S. Department of Energy’s (DOE) Argonne National Laboratory and Quantinuum have demonstrated clear ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results