Abstract: This article considers the problem of solving linear algebraic equations of the form Ax=b among multiagents, which seek a solution by using local information in presence of random ...

Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...

Introduction: The retrospective analysis of continuous glucose monitoring (CGM) timeseries can be hampered by colored and non-stationary measurement noise. Here, we introduce a Bayesian denoising (BD) ...

From the physical world to the virtual world, algorithms are seemingly everywhere. David J. Malan, Professor of Computer Science at Harvard University, has been challenged to explain the science of ...

Quantum computing (QC) has advantages of speed and storage over classical computing, but it is based on a linear paradigm. However, many problems of interest are nonlinear. A viable QC algorithm ...

You are free to share (copy and redistribute) this article in any medium or format within the parameters below: Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must ...

Abstract: This paper presents the computation of feasible paths for mobile robots in known and unknown environments using a QAPF learning algorithm. Q-learning is a reinforcement learning algorithm ...

This contribution is part of the special series of Inaugural Articles by members of the National Academy of Sciences elected in 2009. Contributed by Christos Papadimitriou, September 12, 2014 (sent ...