Results 91 to 100 of about 133,438 (232)
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), new algorithms for PBO have emerged, which are effective on highly ...
Manquinho, V., Marques-Silva, J. P.
core +2 more sources
A SAT Characterization of Boolean-Program Correctness [PDF]
Boolean programs, imperative programs where all variables have type boolean, have been used effectively as abstractions of device drivers (in Ball and Rajamani's SLAM project). To find errors in these boolean programs, SLAM uses a model checker based on binary decision diagrams (BDDs). As an alternative checking method, this paper defines the semantics
K. Rustan, M. Leino
openaire +1 more source
On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming [PDF]
Gregory Morse, Tamás Kozsik
openalex +1 more source
METHOD OF DISTRIBUTION OF EDUCATIONAL LOAD USING NONLINEAR BOOLEAN PROGRAMMING
An approach to the allocation of teaching load at the university, which is based on the simultaneous integration of several disciplines teachers. It is shown that the problem reduces to systems of nonlinear Boolean equations and proposed rank method for
S. В. Minuhin
doaj
Systematic Boolean Satisfiability Programming in Radial Basis Function Neural Network [PDF]
Mohd. Asyraf Mansor +5 more
openalex +1 more source
The core of operations research activity focuses on creating and using models. These models may be linear models, non-linear models, dynamic models, and others.
Maissam Jdid
doaj +1 more source
Analysis of boolean program models for time-shared, paged environments [PDF]
Thomas C. Lowe
openalex +1 more source
Computing Parameter Estimates of a Homogeneous Nested Piecewise Linear Regression
Objective. The aim of the study is to develop an algorithm for identifying the parameters of a homogeneous nested piecewise linear regression model of the first type by the method of least modules. Method.
S. I. Noskov, S. I. Belinskaya
doaj +1 more source
Computation of Boolean functions by randomized programs
AbstractThe average time of computing Boolean functions by straight-line programs with random number generators is studied. Reliable programs, which always compute the correct value of the function in question, and programs computing the desired value with some probability are considered.
openaire +1 more source

