The hitting set problem asks for a collection of sets over a universe U to find a minimum
subset of U that intersects each of the given sets. It is NP-hard and equivalent to the problem …

The optimization of most combinatorial problems is NP-hard, which can be solved by
heuristic algorithms to obtain approximately optimal solutions, especially for large-scale …

Recent studies in the field of machine learning and artificial intelligence (AI) are focusing on
developing hybrid models to simplify the complexity involved in the training of the neural …

Boolean networks are discrete-time dynamic systems that have been used as a model for a
wide range of applications in different areas, especially in Systems Biology. The analysis of …

The development of metaheuristics and Boolean Satisfiability representation plays an
important part in a neural network (NN) and Artificial Intelligence (AI) communities. In this …

We present a hybrid exact algorithm for the Minimal Hitting Set (MHS) Enumeration Problem
for highly heterogeneous CPU‐GPU‐MIC platforms. With several techniques that permit an …

Gene network (GN) inference from temporal gene expression data is a crucial and
challenging problem in systems biology. Expression data sets usually consist of dozens of …

Given a finite universe and a collection of the subsets of the universe, the minimum hitting
set of the collection is the smallest subset of the universe that has non-empty intersection …

The hitting set problem is a generalization of the vertex cover problem to hypergraphs. Xu et
al.(Theor Comput Sci 630: 117–125, 2016) presented a primal-dual algorithm for the …

A inferência de redes de interação gênica a partir de perfis de expressão é um dos
problemas importantes pesquisados em biologia sistêmica, sendo considerado um …