Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("LOGIC ARRAY")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 848

  • Page / 34

Export

Selection :

  • and

ON THE MINIMAL COMPLEXITY OF COMPONENT-MACHINES FOR SELF-CORRECTING NETWORKS.PRIESE L.1976; J. CYBERN.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 97-118; BIBL. 4 REF.Article

ON AN ALGORITHMIC TECHNIQUE FOR HAZARD IDENTIFICATION IN LOGICAL NETWORKSNGUYEN KHUAN QUYNH; KACKI E.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 5-6; PP. 279-300; ABS. GER/RUS; BIBL. 16 REF.Article

SIMULATING THE DELAY IN LOGIC NETWORKS FOR LARGE, HIGH-SPEED COMPUTERSWILSON EA.1979; NATIONAL COMPUTER CONFERENCE/1979/NEW YORK NY; USA; MONTVALE: AFIPS PRESS; DA. 1979; PP. 19-28Conference Paper

ON THE CONSTRUCTION OF BALANCED SWITCHING NETWORKSHWANG FK; LIN S.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 4; PP. 283-307; BIBL. 9 REF.Article

ON THE NATURE OF SOME LOGICAL PARADOXES.PINKAVA V.1977; INTERNATION. J. MAN-MACH. STUD.; G.B.; DA. 1977; VOL. 9; NO 4; PP. 383-398; BIBL. 9 REF.Article

A 3N-LOWER BOUND ON THE NETWORK COMPLEXITY OF BOOLEAN FUNCTIONSSCHNORR CP.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 83-92; BIBL. 10 REF.Article

A NEW LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF BOOLEAN SUMSWEGENER I.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 2; PP. 109-114; BIBL. 7 REF.Article

PROJECT SCHEDULING BY SPECIAL GERT NETWORKSFIX W; NEUMANN K.1979; COMPUTING; AUT; DA. 1979; VOL. 23; NO 3; PP. 299-308; BIBL. 5 REF.Article

DIE REALISIERUNG LOGISCHER FUNKTIONEN DURCH OPTIMALE BAUMFOERMIGE NETZE AUS MULTIPLEXER-ULM'S = REALISATION DES FONCTIONS LOGIQUES AU MOYEN DE RESEAUX LOGIQUES EN ARBRE DE MULTIPLEXEUR ULMTHIELE R.1979; DIGIT. PROCESS.; CHE; DA. 1979; VOL. 5; NO 3-4; PP. 163-180; ABS. ENG/FRE; BIBL. 16 REF.Article

RAPIDITE D'ACTION ET FONCTIONNEMENT DE LA LECTURE DES RESEAUX POUR LE STOCKAGE DE L'INFORMATIONGORYASHKO AP.1979; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1979; NO 3; PP. 109-116; BIBL. 6 REF.Article

BIPARTITE REPRESENTATIONS OF PERMUTATIONS AND PERMUTATION NETWORKSIGARASHI Y; SAKURAZAWA S.1979; TRANS. INST. ELECTRON. COMMUN. ENG. JPN, E; JPN; DA. 1979; VOL. 62; NO 10; PP. 649-655; BIBL. 10 REF.Article

SUR UN ALGORITHME DE SYNTHESE DES SYSTEMES ITERATIFS MULTIDIMENSIONNELSREVIN OM.1978; KIBERNETIKA; UKR; DA. 1978; NO 6; PP. 121-122; ABS. ENG; BIBL. 4 REF.Article

GRANDS SYSTEMES STOCHASTIQUES D'AUTOMATES FINIS ET RESEAUX DE NEURONESROTENBERG AR.1976; AUTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1976; NO 7; PP. 114-122; ABS. ANGL.; BIBL. 17 REF.Article

UN ALGORITHME DE CONSTRUCTION D'UNE SUITE DISCRIMINANTE POUR UN COUPLE D'ETATS D'UN RESEAU LOGIQUEERMILOV VA.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 5; PP. 154-160; ABS. ENG; BIBL. 1 REF.Article

UTILISATION D'UN MODELE RETROSPECTIF RECURRENT POUR LA RESOLUTION DES PROBLEMES D'ANALYSE DES DISPOSITIFS SEQUENTIELS ASYNCHRONESNEMOLOCHNOV OF; SHCHUPAK YU A.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 8; PP. 160-171; ABS. ENG; BIBL. 7 REF.Article

A SIMPLE PROCEDURE TO GENERATE OPTIMUM TEST PATTERNS FOR PARITY LOGIC NETWORKSSE JUNE HONG; OSTAPKO DL.1981; I.E.E.E. TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 5; PP. 356-358; BIBL. 5 REF.Article

TEST GENERATION TECHNIQUESAKERS SB.1980; COMPUTER; USA; DA. 1980; VOL. 13; NO 3; PP. 9-15; BIBL. 39 REF.Article

SYNTHESIS OF GATE-MINIMUM MULTI-OUTPUT TWO-LEVEL NEGATIVE GATE NETWORKSNAKAMURA K.1979; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1979; VOL. 28; NO 10; PP. 768-772; BIBL. 8 REF.Article

COMPLETUDE DES STRUCTURES LES PLUS SIMPLES, GEOMETRIQUEMENT HOMOGENESVITYUTSKIJ VP; CHISTOV VP.1979; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1979; NO 1; PP. 110-118; BIBL. 4 REF.Article

SUR UN PROCEDE D'ETUDE DE LA STABILITE DES PROCESSUS TRANSITOIRES DANS LES RESEAUX D'ELEMENTS LOGIQUESDOENIN VV; SOLOV'EV VP.1979; AVTOMAT. I TELEMEKH.; SUN; DA. 1979; NO 10; PP. 165-172; ABS. ENG; BIBL. 5 REF.Article

INTEGRATION OF THE PHASE-DIFFERENCE RELATIONS IN ASYNCHRONOUS SEQUENTIAL NETWORKS.TOFFOLI T.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 457-463; BIBL. 4 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

MICROPROGRAMMED LOGIC NETWORK DESIGN.LASZLO Z; ARATO P.1978; MICROPROCESSORS; G.B.; DA. 1978; VOL. 2; NO 2; PP. 73-76Article

ON SWITCHING NETWORKS AND BLOCK DESIGNS.CHUNG FRK.1977; IN: ANNU. ASILOMAR CONF. CIRCUITS, SYST., COMPUT. 10; PACIFIC GROVE, CALIF.; 1976; NORTH HOLLYWOOD, CALIF.; WESTERN PERIODICALS; DA. 1977; PP. 212-218; BIBL. 10 REF.Conference Paper

SUR UNE CLASSE DE SYSTEMES ITERATIFS REGULIERS BIDIMENSIONNELSREVIN OM.1977; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1977; NO 4; PP. 146-147; ABS. ANGL.; BIBL. 3 REF.Article

FIABILITE ET SECURITE DE QUELQUES SYSTEMES LOGIQUES.COURTOIS B.1976; IN: AUTOM. LOGIQUES. RECH. APPL. IND. COLLOQ.; PARIS; 1976; PARIS; ASSOC. FR. CYBERN. ECON, TECH.; DA. 1976; PP. 247-259; BIBL. 6 REF.Conference Paper

  • Page / 34