Literatura científica selecionada sobre o tema "Algorithmes de mise en cache"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Algorithmes de mise en cache".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Algorithmes de mise en cache"
Garot, Matthieu. "« 8 Murders Cache-cache ». Récit horrifique et adolescence". Cliniques N° 26, n.º 2 (31 de outubro de 2023): 172–86. http://dx.doi.org/10.3917/clini.026.0172.
Texto completo da fonteAmicelle, Anthony. "Policing & big data. La mise en algorithmes d’une politique internationale". Critique internationale N° 92, n.º 3 (28 de junho de 2021): 23–48. http://dx.doi.org/10.3917/crii.092.0026.
Texto completo da fonteLétourneau, Esther, e Francine M. Mayer. "Un modèle d’analyse de généalogie ascendante". Articles 17, n.º 2 (24 de outubro de 2008): 213–32. http://dx.doi.org/10.7202/600640ar.
Texto completo da fonteTOUHAMI, MOHAMED, e ABDELDJEBAR HAZZAB. "L’AMELIORATION APPORTEE PAR LE CONTROLEUR NLPI PAR RAPPORT AU VGPI". REVUE ROUMAINE DES SCIENCES TECHNIQUES — SÉRIE ÉLECTROTECHNIQUE ET ÉNERGÉTIQUE 68, n.º 2 (3 de julho de 2023): 158–63. http://dx.doi.org/10.59277/rrst-ee.2023.68.2.7.
Texto completo da fonteWilss, Wolfram. "Basic Concepts of MT". Meta 38, n.º 3 (30 de setembro de 2002): 403–13. http://dx.doi.org/10.7202/004608ar.
Texto completo da fonteFéménias, Damien. "Expositions sportives et formes de communication. Médiacultures, positionnements et narrations". Recherches en Communication 50 (16 de fevereiro de 2022): 143–55. http://dx.doi.org/10.14428/rec.v50i50.64183.
Texto completo da fonteWei, Hua, Hong Luo e Yan Sun. "Mobility-Aware Service Caching in Mobile Edge Computing for Internet of Things". Sensors 20, n.º 3 (22 de janeiro de 2020): 610. http://dx.doi.org/10.3390/s20030610.
Texto completo da fonteNachtergael, Magali. "Théâtre d’ombres chez Sophie Calle : les mises en scène du moi et de l’absence". Filer (Sophie Calle), n.º 7 (10 de agosto de 2011): 139–50. http://dx.doi.org/10.7202/1005521ar.
Texto completo da fonteDeslauriers, Mélanie, Claire Durand e Gérard Duhaime. "Que se cache-t-il derrière les portraits statistiques nationaux ?" Sociologie et sociétés 43, n.º 2 (8 de março de 2012): 143–74. http://dx.doi.org/10.7202/1008242ar.
Texto completo da fonteHél-Bongo, Olga. "Métatextualité, mise en abyme et anamorphose dans Le bel immonde de V.Y. Mudimbe". Articles 42, n.º 1-2 (15 de janeiro de 2014): 175–93. http://dx.doi.org/10.7202/1021303ar.
Texto completo da fonteTeses / dissertações sobre o assunto "Algorithmes de mise en cache"
Boussofiane, Fatiha. "Algorithmes de mise en correspondance pour la reconnaissance d'objets partiellement caches". Paris 11, 1992. http://www.theses.fr/1992PA112451.
Texto completo da fonteZhao, Hui. "High performance cache-aided downlink systems : novel algorithms and analysis". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS366.
Texto completo da fonteThe thesis first addresses the worst-user bottleneck of wireless coded caching, which is known to severely diminish cache-aided multicasting gains. We present a novel scheme, called aggregated coded caching, which can fully recover the coded caching gains by capitalizing on the shared side information brought about by the effectively unavoidable file-size constraint. The thesis then transitions to scenarios with transmitters with multi-antenna arrays. In particular, we now consider the multi-antenna cache-aided multi-user scenario, where the multi-antenna transmitter delivers coded caching streams, thus being able to serve multiple users at a time, with a reduced radio frequency (RF) chains. By doing so, coded caching can assist a simple analog beamformer (only a single RF chain), thus incurring considerable power and hardware savings. Finally, after removing the RF-chain limitation, the thesis studies the performance of the vector coded caching technique, and reveals that this technique can achieve, under several realistic assumptions, a multiplicative sum-rate boost over the optimized cacheless multi-antenna counterpart. In particular, for a given downlink MIMO system already optimized to exploit both multiplexing and beamforming gains, our analysis answers a simple question: What is the multiplicative throughput boost obtained from introducing reasonably-sized receiver-side caches?
Abousabea, Emad Mohamed Abd Elrahman. "Optimization algorithms for video service delivery". Thesis, Evry, Institut national des télécommunications, 2012. http://www.theses.fr/2012TELE0030/document.
Texto completo da fonteThe aim of this thesis is to provide optimization algorithms for accessing video services either in unmanaged or managed ways. We study recent statistics about unmanaged video services like YouTube and propose suitable optimization techniques that could enhance files accessing and reduce their access costs. Moreover, this cost analysis plays an important role in decision making about video files caching and hosting periods on the servers. Under managed video services called IPTV, we conducted experiments for an open-IPTV collaborative architecture between different operators. This model is analyzed in terms of CAPEX and OPEX costs inside the domestic sphere. Moreover, we introduced a dynamic way for optimizing the Minimum Spanning Tree (MST) for multicast IPTV service. In nomadic access, the static trees could be unable to provide the service in an efficient manner as the utilization of bandwidth increases towards the streaming points (roots of topologies). Finally, we study reliable security measures in video streaming based on hash chain methodology and propose a new algorithm. Then, we conduct comparisons between different ways used in achieving reliability of hash chains based on generic classifications
Tsigkari, Dimitra. "Algorithms and Cooperation Models in Caching and Recommendation Systems". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS210.
Texto completo da fonteIn the context of on-demand video streaming services, both the caching allocation and the recommendation policy have an impact on the user satisfaction, and financial implications for the Content Provider (CP) and the Content Delivery Network (CDN). Although caching and recommendations are traditionally decided independently of each other, the idea of co-designing these decisions can lead to lower delivery costs and to less traffic at the backbone Internet. This thesis follows this direction of exploiting the interplay of caching and recommendations in the setting of streaming services. It approaches the subject through the perspective of the users, and then from a network-economical point of view. First, we study the problem of jointly optimizing caching and recommendations with the goal of maximizing the overall experience of the users. This joint optimization is possible for CPs that simultaneously act as CDN owners in today’s or future architectures. Although we show that this problem is NP-hard, through a careful analysis, we provide the first approximation algorithm for the joint problem. We then study the case where recommendations and caching are decided by two separate entities (the CP and the CDN, respectively) who want to maximize their individual profits. Based on tools from game theory and optimization theory, we propose a novel cooperation mechanism between the two entities on the grounds of recommendations. This cooperation allows them to design a cache-friendly recommendation policy that ensures a fair split of the resulting gains
Abousabea, Emad Mohamed Abd Elrahman. "Optimization algorithms for video service delivery". Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2012. http://www.theses.fr/2012TELE0030.
Texto completo da fonteThe aim of this thesis is to provide optimization algorithms for accessing video services either in unmanaged or managed ways. We study recent statistics about unmanaged video services like YouTube and propose suitable optimization techniques that could enhance files accessing and reduce their access costs. Moreover, this cost analysis plays an important role in decision making about video files caching and hosting periods on the servers. Under managed video services called IPTV, we conducted experiments for an open-IPTV collaborative architecture between different operators. This model is analyzed in terms of CAPEX and OPEX costs inside the domestic sphere. Moreover, we introduced a dynamic way for optimizing the Minimum Spanning Tree (MST) for multicast IPTV service. In nomadic access, the static trees could be unable to provide the service in an efficient manner as the utilization of bandwidth increases towards the streaming points (roots of topologies). Finally, we study reliable security measures in video streaming based on hash chain methodology and propose a new algorithm. Then, we conduct comparisons between different ways used in achieving reliability of hash chains based on generic classifications
Furis, Mihai Alexandru Johnson Jeremy. "Cache miss analysis of Walsh-Hadamard Transform algorithms /". Philadelphia : Drexel University, 2003. http://dspace.library.drexel.edu/handle/1721.1/109.
Texto completo da fonteWang, Yun. "Stéréovision robotique algorithmes de mise en correspondance /". Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37610700h.
Texto completo da fonteAdelbaset, Ahmed Yaser. "Algorithmes de mise en correspondance en stéréovision passive". Rennes 1, 2001. http://www.theses.fr/2001REN10013.
Texto completo da fontePREVOST, DONALD. "Retines artificielles stochastiques : algorithmes et mise en uvre". Paris 11, 1995. http://www.theses.fr/1995PA112505.
Texto completo da fonteIssa, Hazem. "Mise en correspondance stéréoscopique par algorithmes génétiques : nouveaux codages". Lille 1, 2004. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/2004/50376-2004-3-4.pdf.
Texto completo da fonteLivros sobre o assunto "Algorithmes de mise en cache"
Michaut, François. Méthodes adaptatives pour le signal: Outils mathématiques et mise en oeuvre des algorithmes. Paris: Hermès, 1992.
Encontre o texto completo da fonteStrand, Ray D. Mort sur ordonnance: La vérité consternante que cache la surconsommation de médicaments. Gatineau, Québec: Éditions du Trésor caché, 2005.
Encontre o texto completo da fonteMiclet, Laurent, Yves Kodratoff, Antoine Cornuéjols e Tom Mitchell. Apprentissage artificiel : Concepts et algorithmes. Eyrolles, 2002.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Algorithmes de mise en cache"
Cole, Richard, e Vijaya Ramachandran. "Revisiting the Cache Miss Analysis of Multithreaded Algorithms". In LATIN 2012: Theoretical Informatics, 172–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29344-3_15.
Texto completo da fonteJoshi, Pallavi, M. V. Rathnamma, K. Srujan Raju e Urmila Pawar. "Miss Rate Estimation (MRE) an Novel Approach Toward L2 Cache Partitioning Algorithm’s for Multicore System". In Advances in Intelligent Systems and Computing, 593–603. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5400-1_58.
Texto completo da fonteFOUSSARD, Christian, e Cédric DENIS-RÉMIS. "Algorithme et maîtrise des risques". In Algorithmes et Société, 25–34. Editions des archives contemporaines, 2021. http://dx.doi.org/10.17184/eac.4552.
Texto completo da fonteVignale, François. "Crowdsourcing et bases de données". In Le Crowdsourcing, 105–16. Editions des archives contemporaines, 2021. http://dx.doi.org/10.17184/eac.3914.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Algorithmes de mise en cache"
Cole, Richard, e Vijaya Ramachandran. "Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers". In SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3087556.3087572.
Texto completo da fonteHou, Fang, e Yue-Long Zhao. "A cache management algorithm based on page miss cost". In 2009 International Conference on Information Engineering and Computer Science. ICIECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5364247.
Texto completo da fonteBergel, Itsik, e Soheil Mohajer. "Channel Aware Greedy Algorithm for MISO Cache-Aided Communication". In 2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC). IEEE, 2022. http://dx.doi.org/10.1109/spawc51304.2022.9834007.
Texto completo da fonteChang, Feng-Cheng, e Hsiang-Cheh Huang. "A Study on the Cache Miss Rate in a Genetic Algorithm Implementation". In 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP). IEEE, 2009. http://dx.doi.org/10.1109/iih-msp.2009.56.
Texto completo da fonteHyotaek Sh, Jaegeuk Kim, Dawoon Jung, Jin-Soo Kim e Seungryoul Maeng. "RMA: A Read Miss-Based Spin-Down Algorithm using an NV Cache". In 2008 IEEE International Conference on Computer Design. IEEE, 2008. http://dx.doi.org/10.1109/iccd.2008.4751910.
Texto completo da fonteSree Kumar, Ch, e Bhawani Shankar Pattnaik. "Miss rate analysis of cache oblivious matrix multiplication using sequential access recursive algorithm and normal multiplication algorithm". In 2013 International Conference on Emerging Trends in Communication, Control, Signal Processing and Computing Applications (C2SPCA). IEEE, 2013. http://dx.doi.org/10.1109/c2spca.2013.6749402.
Texto completo da fonte