• No results found

[PDF] Top 20 A new deterministic algorithm for dynamic set cover

Has 10000 "A new deterministic algorithm for dynamic set cover" found on our website. Below are the top 20 most common "A new deterministic algorithm for dynamic set cover".

A new deterministic algorithm for dynamic set cover

A new deterministic algorithm for dynamic set cover

... static set cover problem is NP-complete, it is natural to consider approximation ...An algorithm has an approximation ratio of α if outputs a set cover I with c(I) ≤ α · OP T , where OP ... See full document

26

Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) update time

Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) update time

... on deterministic algorithms for dynamic approximate matching, but they all have Ω(poly(log n)) update ...an algorithm with update time O( √ m/ε 2 ) for maintain- ing a (1 + ε)-approximate maximum ... See full document

15

New deterministic approximation algorithms for fully dynamic matching

New deterministic approximation algorithms for fully dynamic matching

... question, deterministic polylogarithmic- time (1 + )-approximation algorithms were known for the special case of low arboricity graphs [12, 11, ...a deterministic (3 + )- approximation polylogarithmic-time ... See full document

15

An Effective Load Balancing Approach in Cloud Using Dynamic AB Algorithm

An Effective Load Balancing Approach in Cloud Using Dynamic AB Algorithm

... on deterministic selection in the employed bees phase and the probabilistic selection in the other bees ...explore new regions in the search space? The algorithm has a well-balanced exploration and ... See full document

8

Faster deterministic feedback vertex set

Faster deterministic feedback vertex set

... the set of feasible solutions to Disjoint-FVS ...a new connected component in G[U], increasing `(I) by one, at the same time v becomes a tent and t(I) increases by at least one (w may become a tent as ... See full document

7

A NEW SOFT SET BASED PRUNING ALGORITHM FOR ENSEMBLE METHOD

A NEW SOFT SET BASED PRUNING ALGORITHM FOR ENSEMBLE METHOD

... Previous ensemble pruning techniques can be categorized into three branches, the ordering-based pruning, the clustering-based pruning and the optimization-based pruning. Tsoumakas et al. [2009] provided a brief taxonomy ... See full document

8

Design of dynamic algorithms via primal dual method

Design of dynamic algorithms via primal dual method

... a set of the dual variables whose corresponding primal constraints became (approximately) tight at the same ...the dynamic problem, we maintain the data structure, the hierarchical partition and the ... See full document

13

A Modified Ant Colony Optimizer to Solve a Variant of Dynamic TSP

A Modified Ant Colony Optimizer to Solve a Variant of Dynamic TSP

... polynomial algorithm which can solve ...heuristic algorithm proposed to solve NP-hard ...Each algorithm has some deficiencies in terms of converging time, memory space used ...paper, Dynamic ... See full document

5

A New Anytime Dynamic Navigation Algorithm

A New Anytime Dynamic Navigation Algorithm

... Every time, when recalculating needed, the sub-optimality parameter ϵ is reset to be ϵ ′ which is relatively big. By doing this, we expect to return a path as soon as possible [8], [12], [11]. In [18], it is recommended ... See full document

6

A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks

A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks

... EEDSOSC algorithm, a new Energy Efficient Distributed Self- organized approximation algorithm with Optimal Sensor Cover that produces a near-Optimal Query Cover with minimum consumed ... See full document

6

Deterministic fully dynamic data structures for vertex cover and matching

Deterministic fully dynamic data structures for vertex cover and matching

... Our techniques. To see why it is difficult to determin- istically maintain a dynamic (say maximal) matching, consider the scenario when a matched edge incident to a node u gets deleted from the graph. To recover ... See full document

21

A Survey on Randomized Algorithms and its Applications

A Survey on Randomized Algorithms and its Applications

... Randomized algorithms are sometimes much better in terms of performance or sometimes even complexity from their deterministic alternatives. Formal verification methods [14] are normally used to verify randomized ... See full document

6

Deterministic fully dynamic data structures for vertex cover and matching

Deterministic fully dynamic data structures for vertex cover and matching

... the new level is at least α > 1 but only move down when their weight falls below 1 and (b) the weight of edges on the same and lower levels drops by a factor of β between two adjacent ...the new ... See full document

43

Research on Improved Privacy Publishing Algorithm Based on Set Cover

Research on Improved Privacy Publishing Algorithm Based on Set Cover

... Therefore, new differential privacy model is widely used in the data release process with privacy protection ...data set. Mean- while, the table cover set contains some invalid query ... See full document

28

A New Algorithm for Finding a Minimum Dominating Set of Graphs

A New Algorithm for Finding a Minimum Dominating Set of Graphs

... finite set of vertices together with an edge set such that each edge is an unordered pair of ...dominating set of a graph if every vertex which is not in D is adjacent to at least one vertex in D ... See full document

5

Enhanced indoor positioning utilising wi fi fingerprint and QR calibration techniques

Enhanced indoor positioning utilising wi fi fingerprint and QR calibration techniques

... third algorithm, which is EWKNN+Bayesian estimation utilising QR ...last algorithm, which is EWKNN+Bayesian estimation + a Kalman filter utilising QR calibration, has better accuracy in the second and last ... See full document

150

A NEW SOFT SET BASED PRUNING ALGORITHM FOR ENSEMBLE METHOD

A NEW SOFT SET BASED PRUNING ALGORITHM FOR ENSEMBLE METHOD

... This paper analyzes the method of supplemented domains for the numerical simulation of viscous incompressible flow in the complex geometrical domain. The problem is considered in a discrete defined biconnected domain ... See full document

8

A NEW SOFT SET BASED PRUNING ALGORITHM FOR ENSEMBLE METHOD

A NEW SOFT SET BASED PRUNING ALGORITHM FOR ENSEMBLE METHOD

... Differential Evolution, or briefly DE [28][30][31] [32] is a simple but effective search method for continuous optimization problems. According to Xinjie and Mitsuo (2010), DE represents a direction based search that ... See full document

11

IMPROVED DYNAMIC ROUND ROBIN PROCESS SCHEDULING

IMPROVED DYNAMIC ROUND ROBIN PROCESS SCHEDULING

... scheduling algorithm. Rami J. (2009) has proposed a new approach - SAAR algorithm – which uses dynamic time quantum which is repeatedly adjust by the burst time of running ...SRBRR ... See full document

5

Faster deterministic communication in radio networks

Faster deterministic communication in radio networks

... As well as the obvious problems of closing these gaps, there are several other open questions regarding deterministic broadcasting in radio networks. Firstly, the lower bound for undirected networks is weaker than ... See full document

15

Show all 10000 documents...