Results 1 to 10 of about 925,039 (306)

From Legal Text to NP-Complete Decision Models: MPNet Retrieval and Policy Information Extraction

Machine Learning and Knowledge Extraction
This study addresses the growing need to convert unstructured legal and policy documents into formal computational models that support transparent decision-making.
Aigerim Aitim, Anel Auyezova, Bakhtgerey Sinchev, Aksulu Mukhanova   +3 more
doaj   +1 more source

secDrug: a pipeline to discover novel drug combinations to kill drug-resistant multiple myeloma cells using a greedy set cover algorithm and single-cell multi-omics. [PDF]

Blood Cancer J, 2022
Kumar H, Mazumder S, Chakravarti S, Sharma N, Mukherjee UK, Kumar S, Baughn LB, Van Ness BG, Mitra AK.   +8 more
europepmc   +1 more source

Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis

IEEE Access
Online algorithms are crucial for real-time decision-making and adaptability across diverse fields, such as operations research, computer science, and combinatorics. These algorithms handle data incrementally and make decisions without prior knowledge of
Christine Markarian, Claude Fachkha, Noura Yassine   +2 more
doaj   +1 more source

Effectiveness of the GAEC standard of cross compliance Management of set aside on soil erosion control

Italian Journal of Agronomy, 2011
The GAEC standard Management of set aside is applied to arable lands subjected to set aside and kept non-cultivated throughout the year. The standard is also applied to other set aside areas eligible for direct payments.
Paolo Bazzoffi
doaj   +1 more source

Minimal covers of finite sets

Discrete Mathematics, 1973
AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinality, and also by the number of elements in S which they cover uniquely.
Thomas M. Hearne, Carl G. Wagner
openaire   +1 more source

Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation

IEEE Access
Character Distance Sampling (CDS) is part of a broader class of string matching techniques that leverage sampling strategies. These methods provide an effective compromise between the prohibitive space requirements of offline approaches and the high ...
Simone Faro, Thierry Lecroq, Francesco Pio Marino   +2 more
doaj   +1 more source

Efficient cover image selection based on spatial block analysis and DCT embedding

EURASIP Journal on Image and Video Processing, 2019
In steganography, the cover medium is widely treated as a mere container for the embedded information, even though it affects the stego-image quality, security, and robustness. In addition, there is no consensus on the characteristics of a suitable cover
Sa’ed Abed, Suood Abdulaziz Al-Roomi, Mohammad Al-Shayeji   +2 more
doaj   +1 more source

On the activities and partitions of the vertex subsets of graphs [PDF]

Enumerative Combinatorics and Applications, 2021
Kristina Dedndreaj, Peter Tittmann
doaj  

A Minimum Set-Cover Problem with several constraints [PDF]

Annals of computer science and information systems, 2019
Jens Dörpinghaus, Carsten Düing, Vera Weil   +2 more
doaj   +1 more source

Cover contact graphs

Journal of Computational Geometry, 2012
We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles).
Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, Alexander Wolff   +13 more
doaj   +1 more source