UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons

Neural processing letters, 2000-08, Vol.12 (1), p.71-90

2000

Volltextzugriff (PDF)

A characterization of Boolean collections of set-valued functions

Information sciences, 1997, Vol.99 (3), p.195-204

1997

Volltextzugriff (PDF)

Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons

Proceedings / International Symposium on Multiple-Valued Logic, 1998, p.161-166

1998

Volltextzugriff (PDF)

Several remarks on the complexity of set-valued switching functions

Proceedings / International Symposium on Multiple-Valued Logic, 1996, p.166-170

1996

Volltextzugriff (PDF)

Completeness criteria in set-valued logic under compositions with union and intersection

Proceedings / International Symposium on Multiple-Valued Logic, 1997, p.75-82

1997

Volltextzugriff (PDF)

Classification of functions and enumeration of bases of set logic under Boolean compositions

Proceedings 25th International Symposium on Multiple-Valued Logic, 1995, p.78-85

1995

Volltextzugriff (PDF)

On functional entropy

[1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic, 1993, p.100-104

1993

Volltextzugriff (PDF)

Iterative characterizations of Boolean algebras

Discrete Applied Mathematics, 1986-09, Vol.15 (1), p.111-116

1986

Volltextzugriff (PDF)

On the implementation of set-valued non-Boolean switching functions

[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic, 1991, p.166-172

1991

Volltextzugriff (PDF)

Several remarks on algebraic entropy

Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94), 1994, p.319-322

1994

Volltextzugriff (PDF)

An algebraic point of view of the data structures of database systems

Discrete Applied Mathematics, 1989, Vol.24 (1), p.247-260

1989

Volltextzugriff (PDF)

Iteration Properties of Multivalued Switching Functions

IEEE transactions on computers, 1986-02, Vol.C-35 (2), p.173-178

1986

Volltextzugriff (PDF)

Local similarity manifolds

Annali di matematica pura ed applicata, 1983-12, Vol.135 (1), p.279-291

1983

Volltextzugriff (PDF)

An iterative characterization of post algebras

[1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic, 1988, p.124-128

1988

Volltextzugriff (PDF)

Some remarks on entropic distance, entropic measure of connexion and Hamming distance

R.A.I.R.O. Informatique théorique, 1979, Vol.13 (4), p.395-407

1979

Volltextzugriff (PDF)

Sur Une Application Du Principe Pour Minimiser L'Interdependance Dans Les Automates ProbabilistesSubventionneé par CRSNGC, A4063

Annals of Discrete Mathematics, 1980, Vol.8, p.189-193

1980

Volltextzugriff (PDF)

Graph Functions of Boolean Functions

IEEE transactions on computers, 1984-01, Vol.C-33 (1), p.97-99

1984

Volltextzugriff (PDF)

On The Principle of Minimum interdependence

Journal of information & optimization sciences, 1982-01, Vol.3 (2), p.149-172

1982

Volltextzugriff (PDF)

On set-valued functions and Boolean collections

Multiple-Valued Logic, 22nd Symposium (ISMVL '92), 1992, p.250-254

1992

Volltextzugriff (PDF)

ON THE EXISTENCE OF A PERIODIC ANALOGUE OF A FINITE AUTOMATON

Theory of Machines and Computations, 1971, p.207-207

1971

Volltextzugriff (PDF)

Associative Algebraic Structures in the Set of Boolean Functions and Some Applications in Automata Theory

IEEE transactions on computers, 1971-03, Vol.C-20 (3), p.298-303

1971

Volltextzugriff (PDF)

1 – 21 von 21

Menü

Weitere Dienste

Einstellungen

Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons

A characterization of Boolean collections of set-valued functions

Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons

Several remarks on the complexity of set-valued switching functions

Completeness criteria in set-valued logic under compositions with union and intersection

Classification of functions and enumeration of bases of set logic under Boolean compositions

On functional entropy

Iterative characterizations of Boolean algebras

On the implementation of set-valued non-Boolean switching functions

Several remarks on algebraic entropy

An algebraic point of view of the data structures of database systems

Iteration Properties of Multivalued Switching Functions

Local similarity manifolds

An iterative characterization of post algebras

Some remarks on entropic distance, entropic measure of connexion and Hamming distance

Sur Une Application Du Principe Pour Minimiser L'Interdependance Dans Les Automates ProbabilistesSubventionneé par CRSNGC, A4063

Graph Functions of Boolean Functions

On The Principle of Minimum interdependence

On set-valued functions and Boolean collections

ON THE EXISTENCE OF A PERIODIC ANALOGUE OF A FINITE AUTOMATON

Associative Algebraic Structures in the Set of Boolean Functions and Some Applications in Automata Theory

Suchergebnisse filtern