Results 31 to 40 of about 2,347,375 (169)

The Angular Set Covering Problem

IEEE Access
We present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. The decisions are based on locating the facilities and identifying the directional servers installed in ...
Fredy Barriga-Gallegos, Armin Luer-Villagra, Gabriel Gutierrez-Jarpa   +2 more
doaj   +1 more source

Reconstruction of Causal Networks by Set Covering

, 2010
We present a method for the reconstruction of networks, based on the order of nodes visited by a stochastic branching process. Our algorithm reconstructs a network of minimal size that ensures consistency with the data.
A.-L. Barabási, C.S. Wallace, D. Sprinzak, D.J.C. MacKay, E.N. Brown, P. Slavík, S. Nageswara Rao, V. Chvatal   +7 more
core   +1 more source

A Meta-Optimization Approach to Solve the Set Covering Problem

Ingeniería, 2018
Context: In the industry the resources are increasingly scarce. For this reason, we must make a good use of it. Being the optimization tools, a good alternative that it is necessary to bear in mind.
Gino Astorga, Broderick Crawford, Ricardo Soto, Eric Monfroy, José García, Enrique Cortes   +5 more
doaj   +1 more source

Minimal Stable Sets in Tournaments

, 2009
We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets.
Arrow, Banks, Basu, Bordes, Bordes, Bouyssou, Brandt, Brandt, Brandt, Duggan, Dutta, Felix Brandt, Fishburn, Fisher, Gaspers, Gillies, Good, Houy, Laffond, Laffond, Laslier, Miller, Moulin, Moulin, Nash, Schwartz, Schwartz, Shapley, Smith, von Neumann, Wilson, Woeginger   +31 more
core   +3 more sources

Covering of High-Dimensional Sets

, 2022
Let $(\mathcal{X},ρ)$ be a metric space and $λ$ be a Borel measure on this space defined on the $σ$-algebra generated by open subsets of $\mathcal{X}$; this measure $λ$ defines volumes of Borel subsets of $\mathcal{X}$. The principal case is where $\mathcal{X} = \mathbb{R}^d$, $ρ$ is the Euclidean metric, and $λ$ is the Lebesgue measure.
Zhigljavsky, Anatoly, Noonan, Jack
openaire   +2 more sources

Unsplittable coverings in the plane [PDF]

, 2015
A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}.
A Asinowski, B Bollobás, B Grünbaum, B Keszegh, B Keszegh, B Keszegh, D Haussler, D Pálvölgyi, D Pálvölgyi, EW Miller, G Aloupis, G Even, G Tardos, G Tóth, H Gebauer, J Cardinal, J Cardinal, J Matoušek, J Pach, J Pach, J Pach, J Radhakrishnan, M Gibson, M Naszódi, N Alon, N Alon, P Erdős, P Erdős, U Feige   +28 more
core   +4 more sources

Cluster-Based Control Information Exchange in Multi-Channel Ad Hoc Networks With Spectrum Heterogeneity

IEEE Access, 2017
To overcome the constraint of spectrum heterogeneity, i.e., different spatial locations may have different available spectrum resources, nodes in a multi-channel ad hoc network (MCAHN) should exchange necessary control information.
Xuesong Jonathan Tan, Wen Zhans
doaj   +1 more source

Survey of 8 UAV Set-Covering Algorithms for Terrain Photogrammetry

Remote Sensing, 2020
Remote sensing with unmanned aerial vehicles (UAVs) facilitates photogrammetry for environmental and infrastructural monitoring. Models are created with less computational cost by reducing the number of photos required.
Joshua E. Hammond, Cory A. Vernon, Trent J. Okeson, Benjamin J. Barrett, Samuel Arce, Valerie Newell, Joseph Janson, Kevin W. Franke, John D. Hedengren   +8 more
doaj   +1 more source

Attribute Reduction Method of Covering Rough Set Based on Dependence Degree

International Journal of Computational Intelligence Systems, 2021
Attribute reduction is a hot topic in the field of data mining. Compared with the traditional methods, the attribute reduction algorithm based on covering rough set is more suitable for dealing with numerical data.
Li Fachao, Ren Yexing, Jin Chenxia
doaj   +1 more source

Facets of a mixed-integer bilinear covering set with bounds on variables

, 2019
We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a certain way.
Mahajan, Ashutosh, Rahman, Hamidur
core   +1 more source