Results 31 to 40 of about 2,824,860 (307)
On the Randomized Kaczmarz Algorithm [PDF]
IEEE Signal Processing Letters, 2014 The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by \cite{c2}. Illustrative experiments are conducted to support the findings.
Liang Dai 0002 +2 more
openaire +4 more sources
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
On the application of one approach for data clustering in the agro-industrial complex [PDF]
E3S Web of Conferences, 2023 The paper presents an approach to the automatic grouping algorithms development based on parametric optimization models for processing high-volume data in the agrarian and industrial complex.
Rozhnov Ivan P. +4 more
doaj +1 more source
05201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms [PDF]
, 2005 From 15.05.05 to 20.05.05, the Dagstuhl Seminar 05201 ``Design and Analysis of Randomized and Approximation Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Dyer, Martin +2 more
core +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
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
Randomizing multi-product formulas for Hamiltonian simulation [PDF]
Quantum, 2022 Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of quantum simulation
Paul K. Faehrmann +4 more
doaj +1 more source
Proofs of randomized algorithms in Coq [PDF]
Science of Computer Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audebaud, Philippe +1 more
openaire +4 more sources
Algorithms, 2019 In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle.
Napoleão Nepomuceno +2 more
doaj +1 more source
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