Results 201 to 210 of about 1,250 (247)

Stabilization of T-S fuzzy asynchronous Boolean control networks with time delay under noise. [PDF]

Sci Rep
Yang F, Sun Y, Zhang C, Su X, Zhang H.
europepmc   +1 more source

Vaginitis in the Context of an Uncommon Parasomnia: A Case Report. [PDF]

Cureus
Ebeling M, Shufflebarger EF, Pacheco Z.
europepmc   +1 more source

Using Bayesian statistics in confirmatory clinical trials in the regulatory setting: a tutorial review. [PDF]

BMC Med Res Methodol
Lee SY.
europepmc   +1 more source

Second-order facial features are processed analytically in composite faces. [PDF]

Atten Percept Psychophys
Cheng XJ, Little DR.
europepmc   +1 more source

Hybrid Grey Wolf Optimizer with discrete prism dispersion strategy for solving flexible job-shop scheduling problem. [PDF]

Sci Rep
Duan Y, Shi L, Li M, Hua K, Liu T, He L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Length of prime disjunctive normal forms

Mathematical Notes, 1967
The author presents an example of a Logical function of n variables that has a prime disjunctive normal form that asymptotically contains 2n terms. Bibliography of 2 references.
Glagolev V V, V V Glagolev
exaly   +3 more sources

Duality and pseudo duality of dual disjunctive normal forms

Knowledge-Based Systems, 2011
The paper introduces the concepts of dual disjunctive normal forms in classical logic and fuzzy logics with involution negation. The laws of their truth values are studied. One is called duality, the other is called pseudo duality. Dual disjunctive normal forms in classical logic hold duality, and dual disjunctive normal forms in fuzzy logics with ...
Xingfang Zhang
exaly   +2 more sources

An Algorithm for Weak Disjunctive Normal Form Reduction in G3 Logic

2008 International Conference on Computer Science and Software Engineering, 2008
In this paper, we put forward a weak conjunctive normal form for G3, which is similar to the conjunctive normal form for classical propositional logic. We also give two algorithms to reduce a formula to weak conjunctive normal form, where one is based on charactering countermodels in model-based-formulas, and the other is based on rewriting formulas ...
Xianchun Zou, Heng Zhang
exaly   +2 more sources

The shortest disjunctive normal form of a random Boolean function

Random Structures and Algorithms, 2003
AbstractThis paper gives a new upper bound for the average length ℓ(n) of the shortest disjunctive normal form for a random Boolean function of n arguments, as well as new proofs of two old results related to this quantity. We consider a random Boolean function of n arguments to be uniformly distributed over all 2 such functions. (This is equivalent to
exaly   +3 more sources

On the complexity of the disjunctive normal form of threshold functions

Discrete Mathematics and Applications, 2000
Summary: We consider the problem of estimating the complexity of the disjunctive normal form (dnf) of threshold functions in \(n\) variables, where the complexity is the minimal number of simple implicants in the representation of the dnf. It is known that the complexity of the dnf of almost all threshold functions is no less than \(n^2/\log_2n\).
exaly   +3 more sources