Results 51 to 60 of about 1,765 (205)

AN EFFECTIVE METHOD FOR SYNTHESIZING THE ABBREVIATED DISJUNCTIVE NORMAL FORM OF A BOOLEAN FUNCTION

, 2020
In discrete mathematics, minimizing Boolean functions in the class of disjunctive normal forms is one of the necessary tasks. This paper presents an effective method for synthesizing the reduced disjunctive normal form of a Boolean ...
Urunbaev, Erkin
core  

Disjunctive kriging for environmental management

, 1996
Land managers, legislators and law enforcement agencies must often make decisions based on critical thresholds and using estimates that are subject to error. Disjunctive kriging enables this error to be converted to an estimated probability that the true
Webster, R., McGrath, S. P., Oliver, M. A.   +2 more
core   +1 more source

Algorithms for extracting subsystems from a multilevel representation of a system of Boolean functions for joint minimization

Informatika
Objectives. The purpose of experimental research is to determine the effectiveness of new algorithms for extracting the so-called connected subsystems from formula descriptions of the original system of Boolean functions.
P. N. Bibilo, N. A. Kirienko, V. I. Romanov   +2 more
doaj   +1 more source

An efficient algorithm for mining interesting set-valued rules [PDF]

Computer Science Journal of Moldova, 2001
We describe the problem of mining set valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a rule might be “IF HOUSEHOLDSIZE = { Two OR Tree} AND OCCUPATION = {Professional OR ...
Alexandr A. Savinov
doaj  

MINIMIZATION LOGICAL FUNCTION BY METHOD TO ALTERNATIVE ADAPTATION

Advanced Engineering Research, 2009
Approach is offered In article to minimization boolean function, founded on use automaton to adaptation. As bases is used known method to minimization boolean function, founded on partition implicant units made disjunctive normal form boolean function on
Y.O. CHERNYSHEV, N.N. VENCOV
doaj  

Fuzzy Cellular Automata in Conjunctive Normal Form

, 2011
Cellular automata (CA) are discrete dynamical systems comprised of a lattice of finite-state cells. At each time step, each cell updates its state as a function of the previous state of itself and its neighbours.
Forrester, David M.
core   +2 more sources

MINIMIZATION LOGICAL FUNCTION BY METHOD TO ALTERNATIVE ADAPTATION

Вестник Донского государственного технического университета, 2018
Approach is offered In article to minimization boolean function, founded on use automaton to adaptation. As bases is used known method to minimization boolean function, founded on partition implicant units made disjunctive normal form boolean function on
Y.O. CHERNYSHEV, N.N. VENCOV
doaj  

Development of an automaton recognizer of tissue pathologies caused by Chlamydia infection [PDF]

BIO Web of Conferences
Chlamydia belongs to such diseases, in which the blood-brain barrier permeability is disturbed leading to degenerative changes of brain cells and development of neurological symptoms in animals.
Novikova O.V., Kostarev S.N., Sidorova K.A., Tatarnikova N.A., Dragich O.A.   +4 more
doaj   +1 more source

Unification of Disjunctive Feature Descriptions

, 1988
The paper describes a new implementation of feature structures containing disjunctive values, which can be characterized by the following main points: Local representation of embedded dis-junctions, avoidance of expansion to disjunctive normal form and ...
Jochen Dörre, Andreas Eisele, Jochen Drre   +2 more
core   +1 more source

Interpretable Multiclass Models for Corporate Credit Rating Capable of Expressing Doubt

Frontiers in Applied Mathematics and Statistics, 2016
Corporate credit rating is a process to classify commercial enterprises based on their creditworthiness. Machine learning algorithms can construct classification models, but in general they do not tend to be 100% accurate.
Lennart Obermann, Stephan Waack
doaj   +1 more source