Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("TEMPS CALCUL")

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

Origin

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

Results 1 to 25 of 4238

  • Page / 170
Export

Selection :

  • and

MINICOMPUTERS ARE BURSTING OUT ALL OVER.WOODHAM R.1975; NATURE; G.B.; DA. 1975; VOL. 257; NO 5527; PP. 558-564; BIBL. 16 REF.Article

BOUNDS ON THE SPEED-UPS OF PARALLEL EVALUATION OF RECURRENCES.HYAFIL L; KUNG HT.1975; IN: U.S.A.-JAP. COMPUT. CONF. 2. PROC.; TOKYO; 1975; MONTVALE; AM. FED. INF. PROCESS. SOC.; DA. 1975; PP. 178-182; BIBL. 21 REF.Conference Paper

NEW ASPECTS OF DYNAMICAL DAMPING IN AB INITIO MOLECULAR SCF CALCULATIONSRAMEK M; FRITZER HP.1982; COMPUTERS & CHEMISTRY; ISSN 0097-8485; USA; DA. 1982; VOL. 6; NO 4; PP. 165-168; BIBL. 20 REF.Article

LE PROBLEME DE TRANSPORT. UNE METHODE A 2 DIRECTIONSSAWA R.1975; PRACE C.O. P.A.N.; POLSKA; DA. 1975; NO 193; PP. 1-18; ABS. ANGL.; BIBL. 4 REF.Article

THE COMPUTING TIME OF THE EUCLIDENA ALGORITHM.COLLINS GE.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 1; PP. 1-10; BIBL. 12 REF.Article

ON THE PROBABLE BEHAVIOUR OF SOME ALGORITHMS FOR FINDING THE STABILITY NUMBER OF A GRAPHPITTEL B.1982; MATH. PROC. CAMB. PHILOS. SOC.; ISSN 0305-0041; GBR; DA. 1982; VOL. 92; NO 3; PP. 511-526; BIBL. 11 REF.Article

DIE BERECHNUNGSKOMPLEXITAET VON ELEMENTARSYMMETRISCHEN FUNKTIONEN UND VON INTERPOLATIONSKOEFFIZIENTEN = LA COMPLEXITE DES CALCULS DE FONCTIONS SYMETRIQUES ELEMENTAIRES ET DES COEFFICIENTS D'INTERPOLATIONVAN DER WAERDEN HBL.1973; NUMER. MATH.; DTSCH.; DA. 1973; VOL. 20; NO 3; PP. 238-251; ABS. ANGL.; BIBL. 18 REF.Serial Issue

THE EXACT TIME REQUIRED TO PERFORM GENERALIZED ADDITION.FLOYD RW.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 3-5; BIBL. 3 REF.Conference Paper

CONGRUENCE ARITHMETIC ALGORITHMS FOR POLYNOMIAL REAL ZERO DETERMINATION.HEINDEL LE.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 9; NO 1; PP. 109-128; BIBL. 9 REF.Article

THE MARKOV ALGORITHM AS A LANGUAGE PARSER-LINEAR BOUNDSKATZENELSON J.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 5; PP. 465-478; BIBL. 7 REF.Serial Issue

AN INTRODUCTION TO THE DYNAMIC CLUSTERS METHOD. (DYC PROGRAM)DIDAY E.1972; METRA; FR.; DA. 1972; VOL. 11; NO 3; PP. 505-519; ABS. FR. ALLEM. ITAL. ESP.; BIBL. 1 P.Serial Issue

IMPROVED TIME-RESPONSE ALGORITHM FOR THE METHOD OF INEQUALITIESINOOKA H.1982; INT. J. CONTROL.; ISSN 0020-7179; GBR; DA. 1982; VOL. 35; NO 1; PP. 127-138; BIBL. 8 REF.Article

COST EFFECTIVE COMPUTER PROCESSING OF AIRBORNE SCANNER DATA FOR REGIONAL LEVEL MAPPINGTHIRUVENGADACHARI S.1981; PHOTOGRAMM. ENG. REMOTE SENSING; ISSN 0099-1112; USA; DA. 1981; VOL. 47; NO 12; PP. 1705-1708; BIBL. 3 REF.Article

SCHNELLE MULTIPLIKATION VON POLYNOMEN UEBER KOERPERN DER CHARAKTERISTIK 2. = MULTIPLICATION RAPIDE DE POLYNOMES SUR DES CHAMPS DE CARACTERISTIQUE 2SCHONHAGE A.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 7; NO 4; PP. 395-398; ABS. ANGL.; BIBL. 2 REF.Article

EXPECTED TIME BOUNDS FOR SELECTION.FLOYD RW; RIVEST RL.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 3; PP. 165-172; BIBL. 7 REF.Article

DRAWING PICTURES OF SOLID OBJECTS USING A GRAPH PLOTTERGRIFFITHS JG.1973; COMPUTER AIDED DESIGN; G.B.; DA. 1973; VOL. 5; NO 1; PP. 14-21; BIBL. 10 REF.Serial Issue

ESTIMATION DE L'EFFICACITE DES METHODES D'ANALYSE DE LA PRECISION DES SYSTEMES DE COMMANDE NON LINEAIRESKOZEEV VA; YUSUPOV RM.1973; IZVEST. VYSSH. UCHEBN. ZAVED., PRIBOROSTR.; S.S.S.R.; DA. 1973; VOL. 16; NO 1; PP. 30-33; BIBL. 8 REF.Serial Issue

MODIFIED LINEAR MULTISTEP METHODS FOR A CLASS OF STIFF ORDINARY DIFFERENTIAL EQUATIONSBJUREL G.1972; B.I.T.; DANM.; DA. 1972; VOL. 12; NO 2; PP. 142-160; BIBL. 19 REF.Serial Issue

POLYNOMIAL MULTIPLICATION, POWERS AND ASYMPTOTIC ANALYSIS: SOME COMMENTS.FATEMAN RJ.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 3; PP. 196-213; BIBL. 19 REF.Article

MINIMIZING THE COMPUTATION TIME FOR USING THE TECHNIQUE OF SECTIONING FOR DIGITAL FILTERING OF PICTURESHUNT BR.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 11; PP. 1219-1222; BIBL. 3 REF.Serial Issue

SORTING X+Y.HARPER LH; PAYNE TH; SAVAGE JE et al.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 6; PP. 347-349; BIBL. 3 REF.Article

ALGORITHMS FOR FAST EVALUATION OF BOOLEAN EXPRESSIONS.BREITBART Y; REITER A.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 107-116; BIBL. 5 REF.Article

HIGH-SPEED MULTIPLICATION SYSTEMSKAMAL AA; GHANNAM MAN.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 9; PP. 1017-1021; BIBL. 7 REF.Serial Issue

FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME.HADLOCK F.1975; S.I.AM. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 221-225; BIBL. 8 REF.Article

HOW DOES A REAL TIME COMPUTER SPEND ITS TIME.HEERMA MJB; OUD AJHM.1975; J. A; BELG.; DA. 1975; VOL. 16; NO 2; PP. 79-82Article

  • Page / 170