Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Gestión memoria")


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

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


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

Author Country

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


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

Results 1 to 25 of 3157

  • Page / 127

Selection :

  • and

ISMM 2006 (proceedings of the 2006 International Symposium on Memory Management)International Symposium on Memory Management. 2006, isbn 1-595-93221-6, 1Vol, VII-193 p, isbn 1-595-93221-6Conference Proceedings

Answer garden: a tool for growing organizational memoryACKERMAN, M. S.Wirtschaftsinformatik. 1995, Vol 37, Num 3, pp 320-321, issn 0937-6429Article

On the type accuracy of garbage collectionHIRZEL, Martin; DIWAN, Amer.ACM SIGPLAN notices. 2001, Vol 36, Num 1, pp 1-11, issn 1523-2867Conference Paper

Efficient object sampling via weak referencesAGESEN, Ole; GARTHWAITE, Alex.ACM SIGPLAN notices. 2001, Vol 36, Num 1, pp 121-126, issn 1523-2867Conference Paper

Dynamic adaptive pre-tenuringHARRIS, Timothy L.ACM SIGPLAN notices. 2001, Vol 36, Num 1, pp 127-136, issn 1523-2867Conference Paper

The case for profile-directed selection of garbage collectorsFITZGERALD, Robert; TARDITI, David.ACM SIGPLAN notices. 2001, Vol 36, Num 1, pp 111-120, issn 1523-2867Conference Paper

Interchanging two segments of an array in a hierarchical memory systemBOJESEN, Jesper; KATAJAINEN, Jyrki.Lecture notes in computer science. 2001, pp 159-170, issn 0302-9743, isbn 3-540-42512-8Conference Paper

Modèles de conflits dans la mémoire externe des systèmes multiprocesseurs fonctionnant en régime de multiprogrammationVASIL'CHIKOV, V. V; MAMATOV, YU. A.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 3, pp 209-213, issn 0002-3388Article

Towards region-based memory management for mercury programsPHAN, Quan; JANSSENS, Gerda.Lecture notes in computer science. 2006, pp 433-435, issn 0302-9743, isbn 3-540-36635-0, 1Vol, 3 p.Conference Paper

Measuring the cost of storage managementTARDITI, D; DIWAN, A.Lisp and symbolic computation. 1996, Vol 9, Num 4, pp 323-342, issn 0892-4635Article

Bit decision table for hypercube decompositionCHANG, C. H; AZZAM, H. K; DEDIU, H. H et al.Electronics Letters. 1992, Vol 28, Num 8, pp 736-738, issn 0013-5194Article

Composition of mappings given by embedded dependenciesNASH, Alan; BERNSTEIN, Philip A; MELNIK, Sergey et al.ACM transactions on database systems. 2007, Vol 32, Num 1, pp 1-51, issn 0362-5915, 51 p.Article

Data management over the GRID : Heaven or hell? (Panel Description)IOANNIDIS, Yannis.International conference on scientific and statistical database management. 2004, isbn 0-7695-2146-0, 1Vol, p.415Conference Paper

QBIX-G : A transcoding multimedia proxySCHOJER, Peter; BÖSZÖRMENYI, Laszlo; HELLWAGNER, Hermann et al.Proceedings of SPIE, the International Society for Optical Engineering. 2006, pp 60710C.1-60710C.16, issn 0277-786X, isbn 0-8194-6111-3, 1VolConference Paper

Elementary graph algorithms in external memoryKATRIEL, Irit; MEYER, Ulrich.Lecture notes in computer science. 2003, pp 62-84, issn 0302-9743, isbn 3-540-00883-7, 23 p.Conference Paper

Cache oblivious algorithmsKUMAR, Piyush.Lecture notes in computer science. 2003, pp 193-212, issn 0302-9743, isbn 3-540-00883-7, 20 p.Conference Paper

Transaction-based charging in mnemosyne: A peer-to-peer steganographic storage systemROSCOE, Timothy; HAND, Steven.Lecture notes in computer science. 2002, pp 335-349, issn 0302-9743, isbn 3-540-44177-8, 15 p.Conference Paper

Value-profile guided stride prefetching for irregular codeWU, Youfeng; SERRANO, Mauricio; KRISHNAIYER, Rakesh et al.Lecture notes in computer science. 2002, pp 307-324, issn 0302-9743, isbn 3-540-43369-4Conference Paper

Properties of the miss ratio for a 2-level storage model with LRU or FIFO replacement strategy and independent referencesVAN DEN BERG, J; TOWSLEY, D.IEEE transactions on computers. 1993, Vol 42, Num 4, pp 508-512, issn 0018-9340Article

Caching Is Hard—Even in the Fault ModelCHROBAK, Marek; WOEGINGER, Gerhard J; MAKINO, Kazuhisa et al.Algorithmica. 2012, Vol 63, Num 4, pp 781-794, issn 0178-4617, 14 p.Conference Paper

The Five-Minute Rule 20 Years Later (and How Flash Memory Changes the Rules)GRAEFE, Goetz.Communications of the ACM. 2009, Vol 52, Num 7, pp 48-59, issn 0001-0782, 12 p.Article

Multiway iceberg cubing on treesLIENHUA CHOU, Pauline; XIUZHEN ZHANG.Lecture notes in computer science. 2005, pp 620-622, issn 0302-9743, isbn 3-540-30017-1, 1Vol, 3 p.Conference Paper

You Don't Know Jack About Shared Variables or Memory ModelsBOEHM, By Hans-J; ADVE, Sarita V.Communications of the ACM. 2012, Vol 55, Num 2, pp 48-54, issn 0001-0782, 7 p.Article

FastPval: a fast and memory efficient program to calculate very low P-values from empirical distributionMULIN JUN LI; PAK CHUNG SHAM; JUNWEN WANG et al.Bioinformatics (Oxford. Print). 2010, Vol 26, Num 22, pp 2897-2899, issn 1367-4803, 3 p.Article

Algorithms for hardware caches and TLBRAHMAN, Naila.Lecture notes in computer science. 2003, pp 171-192, issn 0302-9743, isbn 3-540-00883-7, 22 p.Conference Paper

  • Page / 127