Results 41 to 50 of about 2,701,676 (183)
Theoretical Computer Science, 2011 6 pages, 1 figure, submitted to Theoretical Computer ...
Ren, Wei, Zhao, Qing
openaire +3 more sources
Problem Decomposition Method to Compute an Optimal Cover for a Set of Functional Dependencies [PDF]
Database Systems Journal, 2011 The paper proposes a problem decomposition method for building optimal cover for a set of functional dependencies to decrease the solving time. At the beginning, the paper includes an overview of the covers of functional dependencies.
Vitalie COTELEA
doaj
Algorithm Based on Heuristic Strategy to Infer Lossy Links in Wireless Sensor Networks
Algorithms, 2014 With the maturing of the actual application of wireless sensor networks, network fault management is eagerly demanded. Severe link packet loss affects the performance of wireless sensor networks, so it must be found and repaired.
Wen-Qing Ma, Jing Zhang
doaj +1 more source
Packing-Based Approximation Algorithm for the k-Set Cover Problem
, 2011 We present a packing-based approximation algorithm for the $k$-Set Cover problem. We introduce a new local search-based $k$-set packing heuristic, and call it Restricted $k$-Set Packing.
Furer, Martin, Yu, Huiwen
core +1 more source
A Multicast Technique for Fixed and Mobile Optical Wireless Backhaul in 5G Networks
IEEE Access, 2018 The data demand for 5G networks is expected to be much higher than current throughput requirements. To meet this demand, a dense topology of interlinked small cells is needed. Laying new copper and fiber in such a dense network would be cost prohibitive.
Michael Atakora, Harsha Chenji
doaj +1 more source
Set It and Forget It: Approximating the Set Once Strip Cover Problem [PDF]
, 2012 We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a one-dimensional region. Each sensor has a fixed battery that drains in inverse proportion to a radius that can be set just once, but activated at any time.
Bar-Noy, Amotz +2 more
core
The Pipelined Set Cover Problem [PDF]
, 2004 A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered and the elements covered at each stage are discarded.
Kamesh Munagala +3 more
openaire +1 more source
Covering Pairs in Directed Acyclic Graphs
, 2013 The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution.
B.Y. Wu +7 more
core +1 more source
Efficient Approximation for Restricted Biclique Cover Problems
Algorithms, 2018 Covering the edges of a bipartite graph by a minimum set of bipartite complete graphs (bicliques) is a basic graph theoretic problem, with numerous applications. In particular, it is used to characterize parsimonious models of a set of observations (each
Alessandro Epasto, Eli Upfal
doaj +1 more source
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry, 2009 We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained in) at least d(p) sets. Here d(p) is an integer demand (requirement) for p.
Chekuri, Chandra +2 more
openaire +2 more sources