• 沒有找到結果。

[PDF] Top 20 On-line algorithms for the dominating set problem

Has 10000 "On-line algorithms for the dominating set problem" found on our website. Below are the top 20 most common "On-line algorithms for the dominating set problem".

On-line algorithms for the dominating set problem

On-line algorithms for the dominating set problem

... Rangan, Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs, Theoret.[r] ... See full document

4

Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

... First, the proposed algorithm actually has a lower rate of errors for hybridization because we modified the Adleman program to generate good DNA sequences for constructing the solution ... See full document

8

Fast Parallel DNA-based Algorithms for Molecular Computation: the Set-Partition Problem

Fast Parallel DNA-based Algorithms for Molecular Computation: the Set-Partition Problem

... paper, the first DNA algorithm of a signed parallel adder, the first DNA algorithm of a signed parallel subtractor, and the first DNA algorithm of a signed parallel comparator are proposed to perform ... See full document

4

A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon

A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon

... 2. The cases of n = 1 and n = 2 are trivial. Suppose n ≥ 3 and one of the nodes makes 4 moves; by the above argument, this node has two neighbors executing rule ...and the upper bound can be ... See full document

4

GENETIC ALGORITHMS FOR THE MODULE ORIENTATION PROBLEM

GENETIC ALGORITHMS FOR THE MODULE ORIENTATION PROBLEM

... The problem of fmding the optimal flip for a given set of modules with minimium total wire length is called the module orientation problem.. It has been proved to be N[r] ... See full document

2

Quantum Algorithms for Biomolecular Solutions of the Satisfiability Problem on a Quantum Machine

Quantum Algorithms for Biomolecular Solutions of the Satisfiability Problem on a Quantum Machine

... with the School of Computer Science and Engineering, University of Aizu, Fukushima 965-8580, Japan (e-mail: ...variables. For the sake of presentation, we sup- pose that u 0 k is used to denote ... See full document

4

The Unique Minimum Dominating Set of Directed Split-Stars

The Unique Minimum Dominating Set of Directed Split-Stars

... distance-k dominating set, for k = 1, 2, in a directed ...However, the problem of finding a minimum distance-k dominating set for k ≥ 3 on directed split- ... See full document

6

Quantum Algorithms for Bio-molecular Solutions to the Satisfiability Problem on a Quantum Computer

Quantum Algorithms for Bio-molecular Solutions to the Satisfiability Problem on a Quantum Computer

... In the DNA-based algorithm for the satisfiability problem, 2 n DNA strands are used to represent 2 n combinational states of n bits in computational ...if the value of n is greater than ... See full document

4

Efficient Algorithms for Some Variants of the Farthest String Problem

Efficient Algorithms for Some Variants of the Farthest String Problem

... of the given strings, ...from the candidate string in less than d positions, we recursively try several ways to move the candidate string “away from” s i ; the term “moving away” means that we ... See full document

7

a note on 15/8 & 3/2-approximation algorithms for the MRCT problem

a note on 15/8 & 3/2-approximation algorithms for the MRCT problem

... in the underlying graph ...path. For an extreme example, a shortest-paths tree is a general star whose core contains only one ...denote the set of all general stars with core R. The ... See full document

10

On-line Computation for the Euclidean P-Median Problems

On-line Computation for the Euclidean P-Median Problems

... algorithms for solving this problem exist in the literature [2, 3, 4, 11, 12, 14, ...since the problem is the NP-hard, all the exact algorithms require ... See full document

7

Algorithms for an FPGA switch module routing problem with application to global routing

Algorithms for an FPGA switch module routing problem with application to global routing

... how the minimal dominating set, whose computation has been described in the previous section, can be used in global ...used for switch matrices. Our demonstrative algorithm will closely ... See full document

15

Constant-Time Algorithms for Dominating Problem on Circular-Arc Graphs

Constant-Time Algorithms for Dominating Problem on Circular-Arc Graphs

... tems model (abbreviated to PARBS) consists of a VLSI array of pro臼ssors connected to a reconfig- urable bus system which can be used to dynamical- Iy obtain vario[r] ... See full document

12

ALGORITHMS FOR THE CHINESE POSTMAN PROBLEM ON MIXED NETWORKS

ALGORITHMS FOR THE CHINESE POSTMAN PROBLEM ON MIXED NETWORKS

... The solution to the C P P (defined on undirected networks) may be obtained efficiently using a polynomial-time bounded matching algorithm owing to Edmonds and Johnson [1-1[r] ... See full document

11

ALGORITHMS FOR THE RURAL POSTMAN PROBLEM

ALGORITHMS FOR THE RURAL POSTMAN PROBLEM

... Comparisons among the three algorithms in terms of average percentage above the lower bound, average rank, number of problems receiving the best solutions, worst solution i[r] ... See full document

10

NEW ALGORITHMS FOR THE LCS PROBLEM

NEW ALGORITHMS FOR THE LCS PROBLEM

... HIRSCHBERG, A linear space algorithm for computing maximal common subsequences, Comm.. HIRSCHBERG, Algorithms for the longest common subsequence problem, .Z.[r] ... See full document

20

Distributed algorithms for the quickest path problem

Distributed algorithms for the quickest path problem

... Using the trivial approach, the quickest path problem can be solved in four main stages: constructing a spanning tree of N, broadcasting all topological information [r] ... See full document

12

The Designs and Analyses of Improved Algorithms for the Counterfeit Coins Problem

The Designs and Analyses of Improved Algorithms for the Counterfeit Coins Problem

... Coin Problem)是一個很著名的古老問題,有許多人對這個問題 也做出了不少的研究以及分析。所謂的偽幣問題就是指在一堆外形都相同的硬幣之中,裡面有 數枚偽幣,而這些偽幣除了重量與正常硬幣不同之外,其餘都跟正常硬幣無異,而偽幣的重量 彼此也都是相同的。現在我們手上有一個只能分辨輕重但沒辦法秤出重量的天秤,應用這個天 ... See full document

28

Optimal algorithms for the average-constrained maximum-sum segment problem

Optimal algorithms for the average-constrained maximum-sum segment problem

... First, the QPM DFG in a waveguide-type PPLN is simu- lated. The index difference is a typ- ical value for a Ti-diffused waveguide on LiNbO ...In the 2-D scheme, the width of ... See full document

8

Promising Edge Set Guided Genetic Local Search Algorithm for the Traveling Salesman Problem

Promising Edge Set Guided Genetic Local Search Algorithm for the Traveling Salesman Problem

... 候選邊集合(candidate set)方法作了修改。原始 LK 的節點順序重排設計裡,只對路徑解嘗試交換在候 選邊集合裡的邊以減少不必要的交換,而 LK 挑選 候選邊集合的方式卻只利用原始的邊之成本來決 定。在 Helsgaun 分析 LK 挑選候選邊集合的規則之 後,覺得 LK 候選邊集合對最佳解邊的涵蓋率依舊 不高,於是在 LKH ... See full document

19

Show all 10000 documents...