Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("TAILLE MEMOIRE")

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 18 of 18

  • Page / 1
Export

Selection :

  • and

NECESSARY AND SUFFICIENT MEMORY SIZE FOR M-HYPOTHESIS TESTING.KOPLOWITZ J.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 1; PP. 44-46; BIBL. 6 REF.Article

COMPUTER STORE ENHANCEMENT BY INTERCHANGE.WHEELER DJ.1978; ELECTRON. LETTERS; GBR; DA. 1978; VOL. 14; NO 16; PP. 498-499; BIBL. 1 REF.Article

INTERFACING THE ONE-DIMENSIONAL SCANNING OF AN IMAGE WITH THE APPLICATION OF TWO-DIMENSIONAL OPERATORSULLMAN S.1981; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1981; VOL. 16; NO 2; PP. 151-157; BIBL. 2 REF.Article

THE IMPLICATIONS OF MICROPROCESSOR ARCHITECTURE ON SPEED, PROGRAMMING AND MEMORY SIZE.PENNEY BK.1977; RADIO ELECTRON. ENGR.; G.B.; DA. 1977; VOL. 47; NO 11; PP. 522-528Article

EDSIM-EVENT BASED DISCRETE SIMULATION USING GENERAL PURPOSE LANGUAGES SUCH AS FORTRAN.PARKIN A; COATS RB.1978; COMPUTER J.; G.B.; DA. 1978; VOL. 21; NO 2; PP. 122-127; BIBL. 7 REF.Article

DEPTH-M SEARCH IN BRANCH-AND-BOUND ALGORITHMSIBARAKI T.1978; INTERNATION. J. COMPUTER INFORM. SCI.; USA; DA. 1978; VOL. 7; NO 4; PP. 315-343; BIBL. 11 REF.Article

PRIM: A FAST MATRIX TRANSPOSE METHODGOLDBOGEN GC.1981; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1981; VOL. 7; NO 2; PP. 255-257; BIBL. 1 REF.Article

SYSTEM CENTURY DCO CALL PROCESSING SOFTWARE STRUCTURE AND OPERATIONWOODWARD JW.1977; COMPSAC 77. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 1/1977-11-08/CHICAGO; USA; NEW YORK: IEEE; DA. 1977; 158-163; BIBL. 1 REF.Conference Paper

ANALYSIS OF STORAGE HIERARCHY.COHEN JW; VAN MARION EWB.1976; J. ENGNG MATH.; NETHERL.; DA. 1976; VOL. 10; NO 3; PP. 263-283; BIBL. 6 REF.Article

BUFFERING AND DECISION FEEDBACK IN COMPUTER NETWORK CHANNELSRYKACZEWSKI R.1979; ARCH. AUTOMAT. TELEMECH.; POL; DA. 1979; VOL. 24; NO 1; PP. 95-105; ABS. POL/RUS; BIBL. 8 REF.Article

Fame as an effect of the memory sizeBINGOL, Haluk.Lecture notes in computer science. 2005, pp 294-303, issn 0302-9743, isbn 3-540-29414-7, 1Vol, 10 p.Conference Paper

Fast homophonic coding with logarithmic memory sizeRYABKO, B; FIONOV, A.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 52Conference Paper

Fast and efficient construction of an unbiased random sequenceRYABKO, B; MATCHIKINA, E.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 472Conference Paper

Mapping real-time motion estimation type algorithms to memory efficient, programmable multi-processor architecturesDE GREEF, E; CATTHOOR, F; DE MAN, H et al.Microprocessing and microprogramming. 1995, Vol 41, Num 5-6, pp 409-423, issn 0165-6074Article

Optimisation de la consommation et de la place mémoire par transformations de boucles = Consumption and storage size optimization by loops transformationsFRABOULET, A; HUARD, G; MIGNOTTE, A et al.Colloque CAO de circuits intégrés et systèmes. 1999, pp 181-184, isbn 2-913329-20-9Conference Paper

Program transformation strategies for memory size and power reduction of pseudoregular multimedia subsystemsDE GREEF, E; CATTHOOR, F; DE MAN, H et al.IEEE transactions on circuits and systems for video technology. 1998, Vol 8, Num 6, pp 719-733, issn 1051-8215Article

On asymptotically optimal methods of prediction and adaptive codingRYABKO, B; TOPSØE, F.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 316Conference Paper

The effects of neighborhood storage size on dynamic programming solutionsPELKKI, M. H.Forest science. 1997, Vol 43, Num 3, pp 387-395, issn 0015-749XArticle

  • Page / 1