Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Randomized algorithm”

Randomized Memetic Artificial Bee Colony Algorithm

Sandeep Kumar, Vivek Kumar Sharma, Rajani Kumari · arXiv (Cornell University) · 2014

Artificial Bee Colony (ABC) optimization algorithm is one of the recent population based probabilistic approach developed for global optimization. ABC is simple and has been showed significant improvement over other Nature Inspired Algorithms (NIAs) when tested over some standard benchmark functions and for some complex real world optimization problems. Memetic Algorithms also become one of the key methodologies to solve the very large and complex real-world optimization problems. The solution search equation of Memetic ABC is based on Golden Section Search and an arbitrary value which tries to balance exploration and exploitation of search space. But still there are some chances to skip the exact solution due to its step size. In order to balance between diversification and intensification capability of the Memetic ABC, it is randomized the step size in Memetic ABC. The proposed algorithm is named as Randomized Memetic ABC (RMABC). In RMABC, new solutions are generated nearby the best so far solution and it helps to increase the exploitation capability of Memetic ABC. The experiments on some test problems of different complexities and one well known engineering optimization application show that the proposed algorithm outperforms over Memetic ABC (MeABC) and some other variant of ABC algorithm(like Gbest guided ABC (GABC),Hooke Jeeves ABC (HJABC), Best-So-Far ABC (BSFABC) and Modified ABC (MABC) in case of almost all the problems.

Cited by 16Open access

A randomized, efficient algorithm for 3SAT

Cristian Dumitrescu · arXiv (Cornell University) · 2017

In this paper I present a 3SAT algorithm based on the randomized algorithm of Papadimitriou from 1991, and Schoning from 1991. We also present strong arguments that this algorithm finds a solution (if it exists) for a 3SAT problem with high probability in polynomial time.

Cited by 0Open access

Randomized distributed algorithm for vertex coloring

S. Choudhary, G. N. Purohit · 2010

Many computational tasks require the cooperation of many processors in the network, but prohibit certain processors pair (or large group) from operating simultaneously. This symmetry breaking technique play a major role in distributed network algorithm. Two symmetry breaking task of "localized" nature are coloring (Vertex Coloring) and Maximal Independence Set (MIS). In this paper, we present an experimental analysis of simple and elegant randomized distributed algorithm for vertex coloring problem

Cited by 0

A Fast Adaptive Randomized PCA Algorithm

Xu Feng, Wenjian Yu · 2023

It is desirable to adaptively determine the number of dimensions (rank) for PCA according to a given tolerance of low-rank approximation error. In this work, we aim to develop a fast algorithm solving this adaptive PCA problem. We propose to replace the QR factorization in randQB_EI algorithm with matrix multiplication and inversion of small matrices, and propose a new error indicator to incrementally evaluate approximation error in Frobenius norm. Combining the shifted power iteration technique for better accuracy, we finally build up an algorithm named farPCA. Experimental results show that farPCA is much faster than the baseline methods (randQB_EI, randUBV and svds) in practical setting of multi-thread computing, while producing nearly optimal results of adpative PCA.

Cited by 3Open access

Randomized Kaczmarz algorithm for CT reconstruction

ZHAO Ke, Pan Jin-xiao, Kong Hui-hua · SHILAP Revista de lepidopterología · 2013

The order of the projection in the algebraic reconstruction technique（ART）method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proofs are given.Thomas Strohmer and Roman Vershynin introduced a randomized version of the Kaczmarz method for consistent,and over-determined linear systems and proved whose rate does not depend on the number of equations in the systems in 2009.In this paper,we apply this method to computed tomography（CT）image reconstruction and compared images generated by the sequential Kaczmarz method and the randomized Kaczmarz method.Experiments demonstrates the feasibility of the randomized Kaczmarz algorithm in CT image reconstruction and its exponential curve convergence.

Cited by 0Open access

A Randomized Algorithm for Minimizing User

Disturbance Due To · 2007

We present a computational approach to a practical problem occurring in the mobile telecommunications industry. Due to changes in cellular technology, there is sometimes the necessity of moving users from one network to another (in this case from TDMA to GSM). In this paper we address the problem of minimizing the number of users a#ected by changes in cellular technology, subject to the constraint that the selected users must be uniformly spread along the covered area. The resulting problem is shown to be NP-hard and a Lagrangian relaxation method is used to find approximate results. We also propose a heuristic algorithm, which is shown to give good results for some instances.

Cited by 0

Sequencing web link using randomized algorithm

Santosh Kumar, Chirag Anand · 2021

Internet has become the essential source of information for everyone holding the smart device in their hands. For the retrieval of any kind of information each and every one rely on the web through internet. In today’s scheme it is sole duty of the data provider to provide the most important and relevant information for users every query posed. Since there is high increment in the amount of data to its highest unit as peta bytes has made it difficult for the user to access the most relevant information for them. In this paper, a Randomized Simulated annealing-based approach for selecting top-ranked web links has been proposed. This approach is using content, usage and structured data to select top quality web links. Further proposed algorithm WDPSA, has been experimentally compared with Iterative improvement-based approach and it has been found that SA based approach is better in selecting top-T web links.

Cited by 0

Randomized Parallel 3D Convex Hull Algorithm

Darcy Quesnel · 1995

This paper presents a randomize, coarse-grained, parallel algorithm which computes the 3-dimensional convex hull of a set of points with high probability in O( n log n p ) time, where n is the number of points, and p is the number of processors. Furthermore, O(1) communication steps are used, with O(n=p) data sent at each step, by each processor. The material presented in this paper summarizes the work done by Dehne, Deng, Dymond, Fabri, and Khokhar in [1]. This paper is submitted to Professor Kranakis towards the completion of 95.508, Computational Geometry. i 1 Introduction This paper presents a randomized algorithm which computes the 3dimensional convex hull of a set of points in O( n log n p ) time with high probability. Where n is the number of points, and p is the number of processors. Furthermore, O(1) communication steps are used, with O(n=p) data sent at each step, by each processor. The algorithm is due to Dehne et al. in [1]. 1.1 Background When we speak of a ra...

Cited by 0

Randomized QLP algorithm and error analysis

Nian‐Ci Wu, Hua Xiang · arXiv (Cornell University) · 2018

In this paper, we describe the randomized QLP (RQLP) algorithm and its enhanced version (ERQLP) for computing the low rank approximation to $A$ of size $m\times n$ efficiently such that $A\approx QLP$, where $L$ is the rank-$k$ lower-triangular matrix, $Q$ and $P$ are column orthogonal matrices. The theoretical cost of the implementation of RQLP and ERQLP only needs $\mathcal{O}(mnk)$. Moreover, we derive the upper bounds of the expected approximation error $\mathbb{E}\left [ (σ_{j}(A) - σ_{j} (L))/ σ_{j}(A) \right] $ for $j=1,\cdots, k$, and prove that the $L$-values of the proposed methods can track the singular values of $A$ accurately. These claims are supported by extensive numerical experiments.

Cited by 0Open access

A Randomized Algorithm for 3-SAT

Ghosh, Subhas Kumar, Misra, Janardan · arXiv (Cornell University) · 2009

In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals in every clause. Given a k-CNF formula phi on n variables, and alpha in{0,1}^n that satisfies phi, a clause of phi is critical if exactly one literal of that clause is satisfied under assignment alpha. Paturi et. al. (Chicago Journal of Theoretical Computer Science 1999) proposed a simple randomized algorithm (PPZ) for k-SAT for which success probability increases with the number of critical clauses (with respect to a fixed satisfiable solution of the input formula). Here, we first describe another simple randomized algorithm DEL which performs better if the number of critical clauses are less (with respect to a fixed satisfiable solution of the input formula). Subsequently, we combine these two simple algorithms such that the success probability of the combined algorithm is maximum of the success probabilities of PPZ and DEL on every input instance. We show that when the average number of clauses per variable that appear as unique true literal in one or more critical clauses in phi is between 1 and 1.9317, combined algorithm performs better than the PPZ algorithm.

Cited by 0Open access

A RANDOMIZED ALGORITHM FOR SLOPE SELECTION

Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu · International Journal of Computational Geometry & Applications · 1992

A set of n distinct points in the plane defines [Formula: see text] lines by joining each pair of distinct points. The median slope of these O(n 2 ) lines was proposed by Theil as a robust estimator for the slope of the line of best fit for the points. We present a randomized algorithm for selecting the k-th smallest slope of such a set of lines which runs in expected O(n log n) time. An efficient implementation of the algorithm and practical experience with the algorithm are discussed.

Cited by 57

A fast randomized circle detection algorithm

Liqin Jia, Chengzhang Peng, Hongmin Liu et al. · 2011

In this paper, we present a fast randomized circle detection algorithm applied to determine the centers and radii of circular components. Firstly, the gradient of each pixel in the image is computed using Gaussian template. Then, the edge map of the image, obtained by applying canny edge detector, is tackled to acquire the curves consisting of 8-adjacency connected edge points. Subsequently, for the detection of the center, N edge points for each curve are picked up, and the point, passed through by the most gradient lines of the edge points, corresponds to a center. The radius can be received by computing the distance between the center and the corresponding edge points. The algorithm performs much better in terms of efficiency compared to randomized circle detection algorithm (RCD), in which a mass of accumulations are done by random sampling. Synthetic images and natural images are used to test the capability of the proposed algorithm. The experimental results indicate that the presented algorithm consumes less computing resources, has excellent performance for detection of single circle, multiple circles, concentric circles, partial circles and overlapped circles, and also has good accuracy despite the presence of different noises and interference.

Cited by 29

A randomized embedding algorithm for trees

Benny Sudakov, Jan Vondrák · 2010

In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a “self-avoiding tree-indexed random walk”. The order of the tree T can be as large as a constant fraction of the order of the graph G, and the maximum degree of T can be close to the minimum degree of G. We show that our algorithm works in a variety of interesting settings. For example, we prove that any graph of minimum degree d without 4-cycles contains every tree of order d2 and maximum degree at most d−2d−2. As there exist d-regular graphs without 4-cycles and with O(d2) vertices, this result is optimal up to constant factors. We prove similar nearly tight results for graphs of given girth and graphs with no complete bipartite subgraph Ks,t.

Cited by 0