Results 21 to 30 of about 2,610,566 (306)
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
Novel and Efficient Randomized Algorithms for Feature Selection
Big Data Mining and Analytics, 2020 Feature selection is a crucial problem in efficient machine learning, and it also greatly contributes to the explainability of machine-driven decisions. Methods, like decision trees and Least Absolute Shrinkage and Selection Operator (LASSO), can select ...
Zigeng Wang +2 more
doaj +1 more source
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 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
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.
Sam Buss, Mia Minnes
openaire +2 more sources
Randomized optimal stopping algorithms and their convergence analysis [PDF]
, 2020 In this paper we study randomized optimal stopping problems and consider corresponding forward and backward Monte Carlo based optimization algorithms.
Bayer, Christian +5 more
core +1 more source
, 2020 From brick-and-mortar stores to omnichannel retail, the efficient selection of products to be displayed on store tables, advertising brochures, or online front pages has become a critical issue.
Carmo Martins, Leandro do +4 more
core +1 more source
08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms [PDF]
, 2008 From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approximation Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Dyer, Martin E. +2 more
core +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