Results 261 to 270 of about 10,143,058 (320)

Randomized parallel algorithms

1996
In this paper we show some important randomized techniques for the parallel processing of discrete problems. In particular, we present a few parallel randomized algorithms frequently used for shortest paths problems, matching problems, depth first search and maximum independent set problems.
Andrea Clementi, José D. P. Rolim, Erik Urland   +2 more
openaire   +1 more source

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

, 2005
M. Mitzenmacher, E. Upfal
semanticscholar   +1 more source

Planned Random Algorithm

2018
Computers are very systemized and none of the procedures conducted by them are random. But computers are seldom required to generate a random number for many practical applications like gaming, accounting, encryption/decryption and many more. The number generated by the computer relies on the time or the CPU clock. A given computer can be programmed to
Anurag Pant, Kunwar Agrawal, B. K. Tripathy   +2 more
openaire   +1 more source

Algorithms and Randomness

Revue de l'Institut International de Statistique / Review of the International Statistical Institute, 1969
P. Martin-Löf, P. Martin-Lof
openaire   +2 more sources

Fault Detection for Non-Gaussian Processes Using Generalized Canonical Correlation Analysis and Randomized Algorithms

IEEE transactions on industrial electronics (1982. Print), 2018
Zhi-wen Chen, S. Ding, Tao Peng, Chunhua Yang, W. Gui   +4 more
semanticscholar   +1 more source

Randomized Priority Algorithms

2004
In a paper of Borodin, Nielsen and Rackoff [8], a framework for abstracting the properties of deterministic greedy-like algorithms was proposed. We extend their model so as to formally define ”randomized greedy-like algorithms” and be able to prove lower bounds on the approximability of a certain problem by such a class of algorithms.
openaire   +1 more source

Randomized Exponentiation Algorithms

2009
A randomized algorithm for function f takes the usual inputs for f together with a stream of random numbers and combines them in a way such that partial or complete knowledge of the atomic operations used to compute f does not easily reveal the values of some or all inputs.
openaire   +1 more source

Insights into randomized algorithms for neural networks: Practical issues and common pitfalls

Information Sciences, 2017
Ming Li, Dianhui Wang
semanticscholar   +1 more source

Randomized Algorithms

2023
openaire   +1 more source

Probabilistic Energy Management Strategy for EV Charging Stations Using Randomized Algorithms

IEEE Transactions on Control Systems Technology, 2018
P. Pflaum, M. Alamir, Mohamed Yacine Lamoudi   +2 more
semanticscholar   +1 more source