ABSTRACT: A binary complete decision table with many-valued decisions is a table with n attributes and 2 n pairwise distinct rows filled with numbers from the set { 0,1 } . Each row of this table is ...
ABSTRACT: We consider various tasks of recognizing properties of DRSs (Decision Rule Systems) in this paper. As solution algorithms, DDTs (Deterministic Decision Trees) and NDTs (Nondeterministic ...
A restricted Boltzmann machine is a fully connected shallow neural network. It can be used to solve many challenging optimization problems. The Boltzmann machines are usually considered probability ...
Abstract: In mobile systems or the failure detection applications, the output for some input event is state-dependent and nondeterministic after intermittent sensor failures or measurement ...
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the ‘canonical boolean representation’ of the syntactic monoid.
Currently, after you perform cache:clear, the resulting contents of the var/cache/ directory change on every run of the corresponding command (at least, timestamps change in ...
Optimizer.state_dict() uses the built-in id() function, which has nondeterministic output between runs. This prevents easy testing for consistent training, even though the actual values are identical.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results