Results 21 to 30 of about 133,463 (288)
Neutral Rewrite Mutation Operator for Genetic Programming applied to Boolean Domain Problems
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 The effect of semantically neutral tree rewrites is analyzed in the context of genetic programming applied to Boolean domain problems. Different setups of the proposed Neutral Rewrite Operator are studied from the perspective of improving performance.
Dmytro Vitel +2 more
doaj +1 more source
Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
IEEE Access, 2020 Solving the satisfiability problems of Boolean polynomial equations is still an open challenge in the fields of mathematics and computer science.
Guangfu Wu +5 more
doaj +1 more source
Using the NEOS Server for Solving Two Classes of Optimization Problems
Кібернетика та комп'ютерні технології, 2022 NEOS server provides free access to the library of necessary software for solving optimization problems. The effective numerical methods developed can be used for a specific application or for solving a wide range of mathematical programming problems ...
Halyna Bila +4 more
doaj +1 more source
Discovering Non-Linear Boolean Functions by Evolving Walsh Transforms with Genetic Programming
Algorithms, 2023 Stream ciphers usually rely on highly secure Boolean functions to ensure safe communication within unsafe channels. However, discovering secure Boolean functions is a non-trivial optimization problem that has been addressed by many optimization ...
Luigi Rovito +2 more
doaj +1 more source
Hardware implementation of Boolean functions based on the automaton model
Informatika, 2023 Objectives. Currently, electronic control devices are increasingly being introduced into various household and production products. Microcontrollers of a wide variety of configurations are widely used as such devices.
A. A. Butov
doaj +1 more source
On complexity of optimized crossover for binary representations [PDF]
, 2006 We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the class of Boolean linear programming problems, where the Boolean vector of ...
Eremeev, Anton
core +3 more sources
Terse Integer Linear Programs for Boolean Optimization [PDF]
Journal on Satisfiability, Boolean Modeling and Computation, 2009 We present a new polyhedral approach to nonlinear Boolean optimization. Compared to other methods, it produces much smaller integer programming models, making it more efficient from a practical point of view. We mainly obtain this by two different ideas: first, we do not require the objective function to be in any normal form. The transformation into a
Buchheim C, Rinaldi G
openaire +4 more sources
Extending boolean regulatory network models with answer set programming [PDF]
, 2010 Because of their simplicity, boolean networks are a popular formalism to model gene regulatory networks. However, they have their limitations, including their inability to formally and unambiguously define network behaviour, and their lack of the ...
Fayruzov, Timur +4 more
core +2 more sources
Exact Boolean Abstraction of Linear Equation Systems
Computation, 2021 We study the problem of how to compute the boolean abstraction of the solution set of a linear equation system over the positive reals. We call a linear equation system ϕ exact for the boolean abstraction if the abstract interpretation of ϕ over the ...
Emilie Allart +2 more
doaj +1 more source
Boolean lexicographic optimization: algorithms & applications [PDF]
, 2011 Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints.
Argelich Romà, Josep +3 more
core +1 more source