Results 31 to 40 of about 9,831,579 (305)
Probabilistic Algorithmic Knowledge [PDF]
Logical Methods in Computer Science, 2005 The framework of algorithmic knowledge assumes that agents use deterministic knowledge algorithms to compute the facts they explicitly know. We extend the framework to allow for randomized knowledge algorithms.
Joseph Y. Halpern, Riccardo Pucella
doaj +1 more source
The Stochastic Team Orienteering Problem with Position-Dependent Rewards
Mathematics, 2022 In this paper, we analyze both the deterministic and stochastic versions of a team orienteering problem (TOP) in which rewards from customers are dynamic. The typical goal of the TOP is to select a set of customers to visit in order to maximize the total
Javier Panadero +3 more
doaj +1 more source
A Randomized Algorithm for Chance Constrained Optimal Power Flow with Renewables
SICE Journal of Control, Measurement, and System Integration, 2017 A chance constrained AC optimal power flow is to find the optimal economic operation plan whose probability satisfying AC power flow equations and various inequality constraints on operating limits of the power system is greater than a specified ...
Takayuki Wada +4 more
doaj +1 more source
Efficient Asynchronous Semi-Stochastic Block Coordinate Descent Methods for Large-Scale SVD
IEEE Access, 2021 Eigenvector computation such as Singular Value Decomposition (SVD) is one of the most fundamental problems in machine learning, optimization and numerical linear algebra.
Fanhua Shang +4 more
doaj +1 more source
Single-pass randomized algorithms for LU decomposition
, 2020 In this paper, we present some single-pass randomized algorithms to compute LU decomposition. These algorithms need only one pass over the original matrix and hence are very suitable for extremely large and high-dimensional matrix stored outside of core ...
Hanyu Li, Shuheng Yin
semanticscholar +1 more source
Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views [PDF]
SIAM Journal on Scientific Computing, 2018 This paper describes practical randomized algorithms for low-rank matrix approximation that accommodate any budget for the number of views of the matrix.
E. Bjarkason
semanticscholar +1 more source
Randomized Average Kaczmarz Algorithm for Tensor Linear Systems
Mathematics, 2022 For solving tensor linear systems under the tensor–tensor t-product, we propose the randomized average Kaczmarz (TRAK) algorithm, the randomized average Kaczmarz algorithm with random sampling (TRAKS), and their Fourier version, which can be effectively ...
Wendi Bao +4 more
doaj +1 more source
A Randomized Algorithm for Optimal PID Controllers
Algorithms, 2018 A randomized algorithm is suggested for the syntheses of optimal PID controllers for MIMO coupled systems, where the optimality is with respect to the H ∞ -norm, the H 2 -norm and the LQR functional, with possible system-performance ...
Yossi Peretz
doaj +1 more source
Regularization Total Least Squares and Randomized Algorithms
MathematicsIn order to achieve an effective approximation solution for solving discrete ill-conditioned problems, Golub, Hansen, and O’Leary used Tikhonov regularization and the total least squares (TRTLS) method, where the bidiagonal technique is considered to ...
Zhanshan Yang, Xilan Liu, Tiexiang Li
doaj +1 more source
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
Journal of the ACM, 2018 This article presents a wp--style calculus for obtaining bounds on the expected runtime of randomized algorithms. Its application includes determining the (possibly infinite) expected termination time of a randomized algorithm and proving positive almost-
Benjamin Lucien Kaminski +3 more
semanticscholar +1 more source