Results 41 to 50 of about 133,463 (288)
Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions
Open Journal of Mathematical OptimizationWe consider the problem of linearizing a pseudo-Boolean function $f : \lbrace 0,1\rbrace ^n \rightarrow \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables.
Walter, Matthias
doaj +1 more source
PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling. [PDF]
PLoS ONE, 2012 Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties.
Liam G Fearnley, Lars K Nielsen
doaj +1 more source
Generating reversible circuits from higher-order functional programs
, 2016 Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function.
A Ambainis +15 more
core +3 more sources
Symbolic Model Checking for Asynchronous Boolean Programs [PDF]
, 2005 Software model checking problems generally contain two differ ent types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among threads. Most modern software model check ers can handle only one source of non-determinism efficiently, but not both.
Byron Cook +2 more
openaire +4 more sources
A Special Role of Boolean Quadratic Polytopes among Other Combinatorial Polytopes
Моделирование и анализ информационных систем, 2016 We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment.
A. N. Maksimenko
doaj +1 more source
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
, 2015 Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them into a SAT formula.
A Graça +18 more
core +1 more source
Pseudo Boolean Programming for Partially Ordered Genomes [PDF]
, 2009 Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes.
Angibaud, Sébastien +3 more
openaire +2 more sources
Rewriting Models of Boolean Programs [PDF]
, 2006 We show that rewrite systems can be used to give semantics to imperative programs with boolean variables, a class of programs used in software model-checking as over- or underapproximations of real programs. We study the classes of rewrite systems induced by programs with different features like procedures, concurrency, or dynamic thread creation, and ...
Ahmed Bouajjani, Javier Esparza
openaire +1 more source
Harnessing Fungal Biowelding for Constructing Mycelium‐Engineered Materials
Advanced Engineering Materials, EarlyView.Mycelium‐bound composites (MBCs) offer low‐carbon alternatives for construction, yet interfacial bonding remains a critical challenge. This review examines fungal biowelding as a biocompatible adhesive, elucidating mycelium‐mediated interfacial mechanisms and their role in material assembly. Strategies to optimize biowelding are discussed, highlighting
Xue Brenda Bai +2 more
wiley +1 more source
Optimization-Based Approaches to Control of Probabilistic Boolean Networks
Algorithms, 2017 Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs), which is well known as a model of gene regulatory networks, has been widely studied.
Koichi Kobayashi, Kunihiko Hiraishi
doaj +1 more source