Integer linear programming for contrasting state interventions in Boolean networks [PDF]
PeerJDrug discovery is a highly complex and time-consuming endeavor, often hindered by issues related to efficacy and safety, resulting in frequent late-stage drug attrition.
Costas Bampos, Vasileios Megalooikonomou
doaj +3 more sources
Low-Rank Boolean Matrix Approximation by Integer Programming
, 2018 Low-rank approximations of data matrices are an important dimensionality reduction tool in machine learning and regression analysis. We consider the case of categorical variables, where it can be formulated as the problem of finding low-rank ...
Gunluk, Oktay +2 more
core +3 more sources
About a regional development model that takes into account environmental problems with budgeting uncertainty [PDF]
E3S Web of Conferences, 2021 Raw-materials base (hereinafter RMB) is one of the largest industries for financial investments in Russia. There are various mathematical descriptions for the development of regions with resource-based economy.
Novikov Artem
doaj +1 more source
Dynamic Programming for Symbolic Boolean Realizability and Synthesis
Lecture Notes in Computer ScienceAbstractInspired by recent progress in dynamic programming approaches for weighted model counting, we investigate a dynamic-programming approach in the context of boolean realizability and synthesis, which takes a conjunctive-normal-form boolean formula over input and output variables, and aims at synthesizing witness functions for the output variables
Yi Lin, Lucas Tabajara, Moshe Y Vardi
exaly +3 more sources
Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems
Кібернетика та комп'ютерні технології, 2023 Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing.
Ivan Sergienko +3 more
doaj +1 more source
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table.
Konstantin I. Chukharev
doaj +1 more source
Algorithms, 2022 There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers.
Aleksey I. Pakhomchik +3 more
doaj +1 more source
Modification of the random search method
Технічна інженерія, 2020 The paper considers linear programming problems with Boolean variables. This is a part of mathematical programming focused on solving practical optimization problems, which could be solved and correctly described with a mathematical model of the problem ...
S.I. Yaremchuk, O.A. Shupikov
doaj +1 more source
An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Boolean networks are conventionally used to represent and simulate gene regulatory networks. In the analysis of the dynamic of a Boolean network, the attractors are the objects of a special attention.
Tarek Khaled, Belaïd Benhamou
doaj +1 more source
BooLSPLG: A Library with Parallel Algorithms for Boolean Functions and S-Boxes for GPU
Mathematics, 2023 In this paper, we present a library with sequential and parallel functions for computing some of the most important cryptographic characteristics of Boolean and vectorial Boolean functions. The library implements algorithms to calculate the nonlinearity,
Dushan Bikov +2 more
doaj +1 more source