Results 21 to 30 of about 2,737,426 (261)
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
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
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
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
Which Local Search Operator Works Best for the Open-Loop TSP?
Applied Sciences, 2019 The traveling salesman problem (TSP) has been widely studied for the classical closed-loop variant. However, very little attention has been paid to the open-loop variant.
Lahari Sengupta +2 more
doaj +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
Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms [PDF]
, 2018 We continue our research on perversely awful randomized algorithms, which started nearly a decade ago. Based on the bogo-method we design a bogo-selection algorithm and variants thereof and analyse them with elementary methods.
Maurer, Jan-Tobias, Holzer, Markus
core +1 more source
International Journal of Applied Mathematics and Computer Science, 2012 It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them.
Formanowicz Piotr, Tanaś Krzysztof
doaj +1 more source
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth [PDF]
, 2003 In this paper we present two novel generic schemes for approximation algorithms for optimization to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k
Chlebikova, Janka +14 more
core +1 more source