THE WORST AND THE MOST PROBABLE PERFORMANCE OF A CLASS OF SET-COVERING ALGORITHMSLIFSCHITZ V; PITTEL B.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 329-346; BIBL. 17 REF.Article

ETUDE DE PERFORMANCE D'ALGORITHMES D'AFFECTATION.FLORY A; GUNTHER J; KOULOUMDJIAN J et al.sdIN: CLASSIF. AUTOM. PERCEPT. ORDINATEUR. SEMIN.; ROCQUENCOURT; 1975; LE CHESNAY, FR.; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 41-52Conference Paper

LOWER BOUNDS FOR ON-LINE TWO-DIMENSIONAL PACKING ALGORITHMSBAKER BS; BROWN DJ; KATSEFF HP et al.1979; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS/1979-03-28/BALTIMORE MD; USA; BALTIMORE: THE JOHNS HOPKINS UNIVERSITY; DA. 1979; PP. 174-179; BIBL. 7 REF.Conference Paper

COMPUTATIONAL GEOMETRY ON INTEGER GRIDSKEIL JM; KIRKPATRICK DG.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 19/1981/MONTICELLO IL; USA; DA. S.D.; PP. 41-50; BIBL. 18 REF.Conference Paper

INTERACTIVE CLUSTERING OF PATTERNSNIEMANN H.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 301-304; BIBL. 8 REF.Conference Paper

ESTIMATION OF THE PROBABILITY OF ERROR WITHOUT GROUND TRUTH AND KNOWN A PRIORI PROBABILITIES.HAVENS KA; MINTER TC; TNADANI SG et al.1977; I.E.E.E. TRANS. GEOSCI. ELECTRON.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 147-152; BIBL. 2 REF.Article

PROBABILISTIC ANALYSIS OF THE PERFORMANCE OF GREEDY STRATEGIES OVER DIFFERENT CLASSES OF COMBINATORIAL PROBLEMSAUSIELLO G; PROTASI M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 24-33; BIBL. 8 REF.Conference Paper

A TWO-PASS PATTERN-RECOGNITION APPROACH TO ISOLATED WORD RECOGNITIONRABINER LR; WILPON JG.1981; BELL SYST. TECH. J.; ISSN 0005-8580; USA; DA. 1981; VOL. 60; NO 5; PP. 739-766; BIBL. 18 REF.Article

PERFORMANCE TRADEOFFS IN DYNAMIC TIME WARPING ALGORITHMS FOR ISOLATED WORD RECOGNITIONMYERS C; RABINER LR; ROSENBERG AE et al.1980; IEE TRANS. ACOUST. SPEECH SIGNAL PROCESS.; ISSN 0096-3518; USA; DA. 1980; VOL. 28; NO 6; PP. 622-635; BIBL. 15 REF.Article

DECA: A DISCRETE-VALUED DATA CLUSTERING ALGORITHMWONG AKC; WANG DCC.1979; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1979; VOL. 1; NO 4; PP. 342-349; BIBL. 20 REF.Article

DYNOC: A DYNAMIC OPTIMAL CLUSTER-SEEKING TECHNIQUETOU JT.1979; INTERNATION. J. COMPUTER INFORM. SCI.; USA; DA. 1979; VOL. 8; NO 6; PP. 541-547; BIBL. 6 REF.Article

STUDIUL COMPARATIV AL EFICIENTEI UNOR ALGORITMI PENTRU PROGRAMAREA GEOMETRICA = COMPARAISON DE L'EFFICACITE DE QUELQUES ALGORITHMES DE PROGRAMMATION GEOMETRIQUELANGA V.1979; STUD. UNIV. BABES-BOLYAI, MATH.; ROM; DA. 1979; VOL. 24; NO 1; PP. 7-15; ABS. ENG; BIBL. 9 REF.Article

FAST ALGORITHMS FOX MATRIX MULTIPLICATION.DOBKIN D.sdIN: THEOR. ALGORITHMES LANG. PROGRAMMATION. SEMIN.; ROCQUENCOURT; 1974-1975; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 61-66; BIBL. 6 REF.Conference Paper

DETERMINING THE SPATIAL CONTAINMENT OF A POINT IN GENERAL POLYHEDRAKALAY YE.1982; COMPUTER GRAPHICS AND IMAGE PROCESSING; ISSN 0146-664X; USA; DA. 1982; VOL. 19; NO 4; PP. 303-334; BIBL. 13 REF.Article

REPRESENTATION OF MULTIVALUED FUNCTIONS USING THE DIRECT COVER METHODPOMPER G; ARMSTRONG JR.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 9; PP. 674-679; BIBL. 7 REF.Article

AN ANALYSIS OF PROXIMITY-DETECTION AND OTHER ALGORITHMS IN THE ROSS SIMULATORFAUGHT WILLIAM S; KLAHR PHILIP.1981; ; USA; SANTA MONICA; RAND; DA. 1981; RAND/N-1587-AF; 46 P.; 28 CM; BIBL. 4 REF.Report

ANALYSIS OF ALGORITHMS ON THREATED TREESBRINCK K; FOO NY.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 2; PP. 148-155; BIBL. 6 REF.Article

ON THE ANALYSIS OF THREE-MATCHING ALGORITHMSFLAJOLET P; STEYAERT JM.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 208-219; BIBL. 12 REF.Conference Paper

SPEEDING UP SUBTREE REPLACEMENT SYSTEMSSTAPLES J.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 1; PP. 39-47; BIBL. 6 REF.Article

AN IMPROVED PROGRAM FOR CONSTRUCTING OPEN HASH TABLESSCHMIDT J; SHAMIR E.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 569-581; BIBL. 14 REF.Conference Paper

PERFORMANCES COMPAREES DE DEUX ALGORITHMES DE CLASSIFICATION AVEC APPRENTISSAGE EN ROBOTIQUEAGUILAR MARTIN J; BALSSA M; CALZADA M et al.1979; RECONNAISSANCE DES FORMES ET INTELLIGENCE ARTIFICIELLE. ASSOCIATION FRANCAISE POUR LA CYBERNETIQUE ECONOMIQUE ET TECHNIQUE. INSTITUT DE RECHERCHE D'INFORMATIQUE ET D'AUTOMATIQUE. CONGRES. 2/1979/TOULOUSE; FRA; ROCQUENCOURT: IRIA; DA. 1979; VOL. 1; PP. 276-291; BIBL. 6 REF.Conference Paper

APPLICATIONS OF THE THEORY OF RANDOM GRAPHS TO AVERAGE ALGORITHMDEWITT HK.1979; ACM 79. ASSOCIATION FOR COMPUTING MACHINERY. 1979 ANNUAL CONFERENCE/1979/DETROIT MI; USA; NEW YORK: ACM; DA. 1979; PP. 251-258; BIBL. 25 REF.Conference Paper

DYNAMIC BIN PACKINGCOFFMAN EG JR; GAREY MR; JOHNSON DS et al.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 227-258; BIBL. 5 REF.Article

PERFORMANCE ANALYSES OF PAGING ALGORITHMS FOR COMPILATION OF A HIGHLY MODULARIZED PROGRAMCHUSHO T; HAYASHI T.1981; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1981; VOL. 7; NO 2; PP. 248-254; BIBL. 14 REF.Article

P-OPTIMAL HEURISTICSLIEBERHERR K.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 2; PP. 123-131; BIBL. 7 REF.Article