VARIABLE TRUNK TREE ROUTINGSHINOHARA M.1982; TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS OF JAPAN. SECTION E; ISSN 0387-236X; JPN; DA. 1982; VOL. 65; NO 11; PP. 621-626; BIBL. 7 REF.Article

A PARALLEL-PIPELINE ARCHITECTURE OF THE FAST POLYNOMIAL TRANSFORM FOR COMPUTING A TWO-DIMENSIONAL CYCLIC CONVOLUTIONTRUONG TK; LIU KY; REED IS et al.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 301-306; BIBL. 12 REF.Article

EFFICIENT ALGORITHMS FOR CHANNEL ROUTINGYOSHIMURA T; KUH E.1982; IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS; ISSN 50629X; USA; DA. 1982; VOL. 1; NO 1; PP. 25-35; BIBL. 8 REF.Article

THE EXECUTION OF PLANS IN AN INDEPENDENT DYNAMIC MICROWORLDMCCALLA G; SCHNEIDER PF.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.1.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 553-555; BIBL. 9 REF.Conference Paper

A LEARNING MODEL FOR ROUTING IN TELEPHONE NETWORKSSRIKANTAKUMAR PR; NARENDRA KS.1982; SIAM J. CONTROL OPTIM.; ISSN 0363-0129; USA; DA. 1982; VOL. 20; NO 1; PP. 34-57; BIBL. 17 REF.Article

ROUTING IN VIRTUELLEN NETZEN = UN ALGORITHME D'ACHEMINEMENT POUR RESEAUX VIRTUELSRULAND C.1981; ELEKTRON. RECHENANL.; ISSN 0013-5720; DEU; DA. 1981; VOL. 23; NO 4; PP. 164-167; ABS. ENG; BIBL. 6 REF.Article

PROBLEMES LIES A LA MODELISATION DU TRAFIC ET A L'ACHEMINEMENT DES APPELS DANS UN RESEAU TELEPHONIQUEGARCIA JEAN MARIE.1980; ; FRA; DA. 1980; 201 P.: ILL.; 30 CM; BIBL. 8 P.; TH. DOCT.-ING./TOULOUSE 3/1980/733Thesis

ON DECENTRALIZED DYNAMIC ROUTING FOR CONGESTED TRAFFIC NETWORKSSARACHIK PE; OZGUNER U.1982; IEEE TRANSACTIONS ON AUTOMATIC CONTROL; ISSN 0018-9286; USA; DA. 1982; VOL. 27; NO 6; PP. 1233-1238; BIBL. 13 REF.Article

AN ALGORITHM FOR SINGLE-ROW ROUTING WITH PRESCRIBED STREET CONGESTIONSTSUKIYAMA S; KUH ES; SHIRAKAWA J et al.1980; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1980; VOL. 27; NO 9; PP. 765-772; BIBL. 12 REF.Article

ANALYSIS OF A FINITE STORAGE SYSTEM WITH BATCH INPUT ARISING OUT OF MESSAGE PACKETIZATIONMANFIELD DR; TRAN GIA P.1982; IEEE TRANS. COMMUN.; ISSN 0090-6778; USA; DA. 1982; VOL. 30; NO 3; PP. 456-463; BIBL. 18 REF.Article

QUEUING EFFECTS IN THE SOLUTION OF CONSTRAINED STORE-AND-FORWARD NETWORK FLOW PROBLEMSRUDOWSKY IS; ROOTENBERG J.1979; INTERNATION. J. SYST. SCI.; GBR; DA. 1979; VOL. 10; NO 7; PP. 775-782; BIBL. 6 REF.Article

METODO DI INSTRADAMENTO ACTATTIVO PER RETI DI COMUNICAZIONE A COMMUTAZIONE DI PACCHETTO = METHODE D'ACHEMINEMENT ADAPTATIF POUR UN RESEAU DE TRANSMISSIONS A COMMUTATION DE PAQUETSBARBERIS G; LAMBARELLI L; MICCA G et al.1978; C.S.E.L.T., RAPP. TEC.; ITA; DA. 1978; VOL. 6; NO 4; PP. 257-257; BIBL. 11 REF.Article

THE MODELING OF ADAPTIVE ROUTING IN DATA - COMMUNICATION NETWORKS.SEGALL A.1977; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1977; VOL. 25; NO 1; PP. 85-95; BIBL. 15 REF.Article

A CLASS OF DECENTRALIZED ROUTING ALGORITHMS USING RELAXATION.STERN TE.1977; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1977; VOL. 25; NO 10; PP. 1092-1102; BIBL. 14 REF.Article

IDENTIFIERS (NAMING) IN DISTRIBUTED SYSTEMSWATSON RW.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 105; PP. 191-210Conference Paper

OPTIMIZATION PROBLEMS IN COMPUTER NETWORK DESIGNSAMOYLENKO SI.1981; COMPUT. NETWORKS; ISSN 0376-5075; NLD; DA. 1981; VOL. 5; NO 3; PP. 177-186; BIBL. 5 REF.Article

DATA ROUTING AND TRANSPOSITIONS IN PROCESSOR ARRAYSJESSHOPE CR.1980; ICL TECH. J.; ISSN 0142-1557; GBR; DA. 1980; VOL. 2; NO 2; PP. 191-206; BIBL. 21 REF.Article

GRAPHS AND QUESTIONNAIRESPICARD CF.1980; N.-HOLLAND MASH. STUD.; NLD; DA. 1980; VOL. 32; 444 P.; BIBL. 16 P.Serial Issue

ROUTE PLANNING RULES FOR PRIMARY PCMJINMAN M.1980; TELECOMMUNIC. J. AUSTRAL.; AUS; DA. 1980; VOL. 30; NO 1; PP. 34-39Article

NETWORK ROUTING AND ANALYSIS VIA DECOMPOSITIONSHAHEEN AA; MARK JW; MAJITHIA JC et al.1979; COMPUTER NETWORKING SYMPOSIUM/1979/GAITHERSBURG MD; USA; NEW YORK: IEEE; DA. 1979; PP. 101-109; BIBL. 7 REF.Conference Paper

A MODEL FOR EFFICIENT ROUTING IN S/F COMPUTER COMMUNICATIONS NETWORKLIVNE A; BOORSTYN RR.1979; EURO IFIP 79. EUROPEAN CONFERENCE ON APPLIED INFORMATION TECHNOLOGY/1979/LONDRES; NLD/USA/GBR; AMSTERDAM: NORTH-HOLLAND/NEW YORK: NORTH-HOLLAND/OXFORD: NORTH-HOLLAND; DA. 1979; PP. 343-350; BIBL. 8 REF.Conference Paper

ANALYZING OPERATOR TROUBLE REPORTSFORD GA.1978; BELL LAB. REC.; USA; DA. 1978; VOL. 56; NO 3; PP. 58-63Article

A MINIMUM DELAY ROUTING ALGORITHM USING DISTRIBUTED COMPUTATION.GALLAGER RG.1977; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1977; VOL. 25; NO 1; PP. 73-85; BIBL. 16 REF.Article

FILE ALLOCATION IN A DISTRIBUTED COMPUTER COMMUNICATION NETWORKLANING LJ; LEONARD MS.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 232-244; BIBL. 27 REF.Article

PROGRAMS FOR TWO-SIDED PRINTED CIRCUIT BOARD DESIGNROSA RC; LUCIO TP.1979; COMPUTER AIDED DESIGN; GBR; DA. 1979; VOL. 11; NO 5; PP. 297-303; BIBL. 7 REF.Article