Results 71 to 80 of about 2,701,676 (183)

On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space

open access: yesSensors, 2017
Sensor networks have been used in a rapidly increasing number of applications in many fields. This work generalizes a sensor deployment problem to place a minimum set of wireless sensors at candidate locations in constrained 3D space to k-cover a given ...
Chase Q. Wu, Li Wang
doaj   +1 more source

Test Sets for Vertex Cover Problems

open access: yesElectronic Notes in Discrete Mathematics, 1999
Abstract We describe the structure of the unique minimal test set T for a family of vertex cover problems. The set T corresponds to the Grobner basis of the binomial ideal for the problem as described in [1]. While T has a surprisingly simple structure, in particular when the underlying graph is complete, it is N P -complete to decide whether ...
M HAYER, W HOCHSTATTLER
openaire   +1 more source

Variable-entered Karnaugh Map Procedures for Obtaining the Irredundant Disjunctive Forms of a Switching Function from Its Complete Sum

open access: yesJournal of King Saud University: Engineering Sciences, 2002
The covering problem, a classical problem in switching theory, involves the selection of some prime implicants irredundantly to cover the asserted part of an incompletely specified switching function.
Ali M. Rushdi, Husain A. Al-Yahya
doaj   +1 more source

The Complexity of the Minimum Sensor Cover Problem with Unit-Disk Sensing Regions over a Connected Monitored Region

open access: yesInternational Journal of Distributed Sensor Networks, 2011
This paper considers the complexity of the Minimum Unit-Disk Cover (MUDC) problem. This problem has applications in extending the sensor network lifetime by selecting minimum number of nodes to cover each location in a geometric connected region of ...
Ren-Song Ko
doaj   +1 more source

Solving a fuzzy set-covering problem

open access: yesMathematical and Computer Modelling, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hwang, M. J., Chiang, C. I., Liu, Y. H.
openaire   +2 more sources

Addressing the spatial disparity of COVID-19 vaccination services: A spatial optimisation approach

open access: yesInternational Journal of Applied Earth Observations and Geoinformation
The COVID-19 pandemic has posed global public health threats. The mass COVID-19 vaccination has continuously played a central role in containing this pandemic.
Huanfa Chen   +4 more
doaj   +1 more source

One-Three Join: A Graph Operation and Its Consequences

open access: yesDiscussiones Mathematicae Graph Theory, 2017
In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained ...
Shalu M.A., Devi Yamini S.
doaj   +1 more source

Approximation of Euclidean k-size cycle cover problem

open access: yesCroatian Operational Research Review, 2014
For a fixed natural number k, a problem of k collaborating salesmen servicing the same set of cities (nodes of a given graph) is studied. We call this problem the Minimumweight k-size cycle cover problem (or Min-k-SCCP) due to the fact that the problem ...
Michael Khachay, Katherine Neznakhina
doaj   +1 more source

Using Machine Learning Methods Jointly to Find Better Set of Rules in Data Mining

open access: yesMATEC Web of Conferences, 2017
Rough set-based data mining algorithms are one of widely accepted machine learning technologies because of their strong mathematical background and capability of finding optimal rules based on given data sets only without room for prejudiced views to be ...
SUG Hyontai
doaj   +1 more source

A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm

open access: yesBiomimetics
The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem for
Dante Leiva   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy