A distributed heuristic for minimum target set
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
... One particular difficulty stems from the fact that network nodes are not aware of n, the total number of nodes, and thus do not know when the dlog ne iterations of the pruning phase have completed. For this reason, nodes ...
15
Distributed Set Reachability
... these distributed graph engines make it difficult to exploit shared computations and yet to fully benefit from the un- derlying distribution ...(i.e., set-) reachability ...
16
An efficient delay-constrained minimum spanning tree heuristic
... Some distributed real-time control applications and the broadcasting of critical network state information are just a few ...delay-constrained minimum Steiner tree heuristics, can be used to construct ...
16
Distributed construction of minimum connected dominating set in Wireless Sensor Network using two-hop information
... is, it represents the class of CDS construction techniques which first forms an MIS and then connect the MIS nodes greedily using different techniques. The S-MIS approach 790 [16] and collaborative cover heuristic ...
50
Q-Coverage Maximum Connected Set Cover (QC-MCSC) Heuristic for Connected Target Problem in Wireless Sensor Network
... consisting of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions. Wireless sensors networks (WSNs) can operate in harsh environments in which ...
7
Exact and Heuristic Methods for the Weapon Target Assignment Problem
... and Heuristic Algorithms for the Weapon Target Assignment Problem Ravindra ...Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations ...
21
State-set branching: Leveraging BDDs for heuristic search
... 7.2. D x V y M z The D x V y M z domain is an artificial puzzle domain where the dependency between objects in the domain can be adjusted without changing the number of bits in the state encoding. The domain has the ...
37
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
... Appendix In order to facilitate the reading of our paper, we give the proof of Fischer’s Theorem 1 in Section 2 as follows. Proof of Theorem 1 (Fischer [3]). Let b > 1 be any constant and let G be a connected graph on ...
14
Heuristic Algorithms for Server Allocation in Distributed VoIP Conferencing
... 3.1 Algorithms: Phase-I The algorithm suggested here is divided into two phases. The first one is the assignment phase. Here the clients are assigned to CSs in set F S G ⊆ F S . CSs only in F S G are considered; ...
6
HEURISTIC APPROACH FOR OPTIMIZATION OF LOAD BALANCING IN DISTRIBUTED SYSTEMS
... A fragment is allocated to a site in such a way that extensive data transfer cost is avoided and the capacity of the site suit to the execution environment of the system. The proposed algorithm involves stepwise ...
12
A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer
... The clusters should preferably be connected because we cannot influence to which vertices in a cluster the load balancer will assign the processes of a BSP program; in case they are spread over two or more non-connected ...
10
Heuristic solutions to the target identifiability problem in directional sensor networks
... built-in target identifia- bility needs to be re-examined in directional sensor networks, as it does not always hold ...of target identifiability in a directional sensor network - this leads to the ...
60
Computationally efficient distributed minimum wilcoxon norm
... Incremental Minimum Wilcoxon Norm As an efficient high durable system the power consumption thus computational complexity load should be controlled in adaptive filter ...of distributed estimation, a ...
76
Approximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees
... employ distributed architectures, our centralized application-centric approach can still be used to provide theoretical performance bounds on the multicast delay in such ...
11
Privacy-Preserving Distributed Set Intersection
... specific set operation for the two sets held by the provider and ...with minimum possible disclosure of information, that is, the client learns nothing except the final result of the set ...
15
Heuristic Algorithm for Graph Coloring Based On Maximum Independent Set
... of heuristic algorithms have been developed for the graph coloring problem, but unfortunately, on any given instance, they may produce colorings that are very far from ...independent set. The select a node ...
10
Treewidth governs the complexity of target set selection
... we target so as to persuade as many individuals in the network as possible? The first to study this question from an algorithmic point of view were Kempe et ...a target set of size at most k that ...
10
Reliable Steganalysis Using a Minimum Set of Samples and Features
... article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly ...
13
a minimum total dominating set ∗
... a set X ⊆ V such that each edge of G is incident to at least one vertex of ...A minimum vertex cover is a vertex cover of smallest possible ...a minimum vertex cover of ...
12
Declarative heuristic search for pattern set mining
... a set becomes harder as the set ...a set size as low as 3. Greedy search performs better, but for a set size of 12 it no longer finds a solution on four of the eleven ...this set size, ...
8