Results 31 to 40 of about 10,143,058 (320)
The Online Reservation Problem
Algorithms, 2020 Many sharing-economy platforms operate as follows. Owners list the availability of resources, prices, and contract-length limits. Customers propose contract start times and lengths. The owners decide immediately whether to accept or decline each proposal,
Shashank Goyal, Diwakar Gupta
doaj +1 more source
Probabilistic Algorithmic Randomness
The Journal of Symbolic Logic, 2013 AbstractWe introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness.
Buss, Sam, Minnes, Mia
openaire +2 more sources
Randomized Algorithms for Data-Driven Stabilization of Stochastic Linear Systems [PDF]
Data Science Workshop, 2019 Data-driven control strategies for dynamical systems with unknown parameters are popular in theory and applications. An essential problem is to prevent stochastic linear systems becoming destabilized, due to the uncertainty of the decision-maker about ...
Mohamad Kazem Shirani Faradonbeh +2 more
semanticscholar +1 more source
Scholarpedia, 2007 We consider algorithmic randomness in the Cantor space C of the infinite binary sequences. By an algorithmic randomness concept one specifies a set of elements of C, each of which is assigned the property of being random. Miscellaneous notions from computability theory are used in the definitions of randomness concepts that are essentially rooted in ...
Jan Reimann, Rodney Downey
openaire +3 more sources
A Quantum Algorithm for the Commutativity of Finite Dimensional Algebras
IEEE Access, 2019 A quantum procedure for testing the commutativity of a finite dimensional algebra is introduced. This algorithm, based on Grover's quantum search, is shown to provide a quadratic speed-up (when the number of queries to the algebra multiplication ...
Elias F. Combarro +2 more
doaj +1 more source
Formalizing Randomized Matching Algorithms [PDF]
Logical Methods in Computer Science, 2012 Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning.
Dai Tri Man Le, Stephen A. Cook
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
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
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
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words [PDF]
, 2012 Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional ...
Kao, Ming-Yang +3 more
core +2 more sources