Algorithm for finding the set U
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions
... vertex set V ...vertices u = v, we denote by N H (u, v) the set of vertices adjacent to both u and v, namely N H (u, v) = N H (u) ∩ N H ...of u and v and it is ...
31
A New Algorithm for Finding a Minimum Dominating Set of Graphs
... In the present paper the concept of relative domination power of vertices for finite undirected graphs have been introduced. An algorithm has been developed to obtain a minimum dominating set of a graph. ...
5
A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks
... 1 Algorithm 1 always stabilizes, and finds a minimal positive influence dominating set ...pointer set P (i) makes a finite number of moves since it only use the information of its neigh- ...
7
Hybrid Algorithm for Finding Common Elements of the Set of Generalized Equilibrium Problems and the Set of Fixed Point Problems of Strictly Pseudocontractive Mapping
... The set of solutions of 1.1 is denoted by EPF. Given a mapping T : C → H, let Fx, y Tx, y − x for all x, y ∈ C. Then, z ∈ EPF if and only if Tz, y − z ≥ 0 for all y ∈ C; that is, z is a solution of the variational ...
19
Finding the circle that best fits a set of points
... The preceding equations are used in a traditional conjugate gradient method, assuming x and y have been initialized, as shown in algorithm 2 (page 11). The parameters of the algorithms are the maximal number of ...
11
Finding discrete logarithms with a set orbit distinguisher
... consider finding discrete logarithms in a group G when the help of an algorithm D that distinguishes certain subsets of G from each other is ...if algorithm D is polynomial- time with complexity ...
17
A Fast Algorithm For Finding Hamilton Cycles
... new algorithm versus the old using a set of graphs known as knight’s graphs, based upon the movement of knights on a variably sized chess ...extension algorithm, by the vertex selection modifications ...
129
Finding collisions for MD4 hash algorithm using hybrid algorithm
... evolutionary algorithm. For the OP parameter used in correction algorithm value OP = 7 was ...third set of sufficient conditions (with successively 62, 123 and 144 conditions) are shown in Table ...
14
An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem
... exact algorithm that can handle both mutual exclusivity and the weight arising from ...and algorithm could discover the true causes behind the phe- notypes, such as what SGA events lead to abnormality of ...
12
On finding approximate nearest neighbours in a set of compressible signals
... involved. Finding the near- est neighbor in a database is fundamental for many applica- tions; [6] presents a good overview of this ...huge set of compressible signals. Our algorithm uses only the ...
5
Finding rough and fuzzy-rough set reducts with SAT
... heuristic algorithm that is often applied to discernibility functions to find a single reduct ...The algorithm begins by setting the current reduct candidate, R, to the empty ...the algorithm ...
59
A fast and low-storage algorithm for finding quantile
... In the simulation described in the next section, our algorithm needs the shifting mechanism about 100 times for finding the .95th sample quantile from a data set of size 500,000, while D[r] ...
10
Cluster Search Algorithm for Finding Multiple Optima
... the algorithm, the treed Gaussian process emulator uses the current training point set to predict a large gridded sample of ...search algorithm, the first minimum is found by searching from the ...
17
A cluster-finding algorithm for free-streaming data
... a set of measurements corresponding to a single (or a limited number of) event, in which clusters can be searched ...data set in which to search for neighbouring active channels is thus well ...
6
Hash Algorithm for Finding Associations between Genes
... 2, which consumes too much time for generation of large item set -2. For the next iteration we need 3 combinations. Remove transaction T500 because it has only one large 2-itemset. Transaction T300 contains A only ...
10
New Algorithm of Seed Finding for Track Reconstruction
... the left image of the figure 3, the seed finding problem is really hard and time consuming on any pro- jection due to overcrowding the area of search by hits 1 . To find a seed from the set of hits registered by a ...
6
Quantum Algorithm for Finding the Negative Curvature Direction
... curvature direction could be presented in time ˜ O(poly(r, log d)ϵ −3 ) with l 2 norm error bounded in ϵ, when the complete basis set {s i } r i=1 is given. We also notice some recent breakthroughs about ...
65
Genetic Algorithm for Finding Shortest Path in a Network
... Many human inventions were inspired by nature. Artificial neural networks are one example. Another example is Genetic Algorithms (GA). GAs search by simulating evolution, starting from an initial set of solutions ...
6
Finding magic squares with Douglas—Rachford algorithm
... About the authors Francisco J. Aragón Artacho earned his Ph.D. in 2007 from the University of Murcia (Spain). He subsequently held a postdoctoral position “Juan de la Cierva” at the University of Alicante. In 2011 he ...
23
Quantum Advantages Quantum Algorithm for Finding the Minimum
... search algorithm and will be using the ideas from that to create our own simple algorithm that finds the minimum value from a given set of ...
54