Gotowa bibliografia na temat „Algorithmes de mise en cache”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Algorithmes de mise en cache”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Algorithmes de mise en cache"
Garot, Matthieu. "« 8 Murders Cache-cache ». Récit horrifique et adolescence". Cliniques N° 26, nr 2 (31.10.2023): 172–86. http://dx.doi.org/10.3917/clini.026.0172.
Pełny tekst źródłaAmicelle, Anthony. "Policing & big data. La mise en algorithmes d’une politique internationale". Critique internationale N° 92, nr 3 (28.06.2021): 23–48. http://dx.doi.org/10.3917/crii.092.0026.
Pełny tekst źródłaLétourneau, Esther, i Francine M. Mayer. "Un modèle d’analyse de généalogie ascendante". Articles 17, nr 2 (24.10.2008): 213–32. http://dx.doi.org/10.7202/600640ar.
Pełny tekst źródłaTOUHAMI, MOHAMED, i 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, nr 2 (3.07.2023): 158–63. http://dx.doi.org/10.59277/rrst-ee.2023.68.2.7.
Pełny tekst źródłaWilss, Wolfram. "Basic Concepts of MT". Meta 38, nr 3 (30.09.2002): 403–13. http://dx.doi.org/10.7202/004608ar.
Pełny tekst źródłaFéménias, Damien. "Expositions sportives et formes de communication. Médiacultures, positionnements et narrations". Recherches en Communication 50 (16.02.2022): 143–55. http://dx.doi.org/10.14428/rec.v50i50.64183.
Pełny tekst źródłaWei, Hua, Hong Luo i Yan Sun. "Mobility-Aware Service Caching in Mobile Edge Computing for Internet of Things". Sensors 20, nr 3 (22.01.2020): 610. http://dx.doi.org/10.3390/s20030610.
Pełny tekst źródłaNachtergael, Magali. "Théâtre d’ombres chez Sophie Calle : les mises en scène du moi et de l’absence". Filer (Sophie Calle), nr 7 (10.08.2011): 139–50. http://dx.doi.org/10.7202/1005521ar.
Pełny tekst źródłaDeslauriers, Mélanie, Claire Durand i Gérard Duhaime. "Que se cache-t-il derrière les portraits statistiques nationaux ?" Sociologie et sociétés 43, nr 2 (8.03.2012): 143–74. http://dx.doi.org/10.7202/1008242ar.
Pełny tekst źródłaHél-Bongo, Olga. "Métatextualité, mise en abyme et anamorphose dans Le bel immonde de V.Y. Mudimbe". Articles 42, nr 1-2 (15.01.2014): 175–93. http://dx.doi.org/10.7202/1021303ar.
Pełny tekst źródłaRozprawy doktorskie na temat "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.
Pełny tekst źródłaZhao, Hui. "High performance cache-aided downlink systems : novel algorithms and analysis". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS366.
Pełny tekst źródłaThe 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.
Pełny tekst źródłaThe 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.
Pełny tekst źródłaIn 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.
Pełny tekst źródłaThe 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.
Pełny tekst źródłaWang, Yun. "Stéréovision robotique algorithmes de mise en correspondance /". Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37610700h.
Pełny tekst źródłaAdelbaset, Ahmed Yaser. "Algorithmes de mise en correspondance en stéréovision passive". Rennes 1, 2001. http://www.theses.fr/2001REN10013.
Pełny tekst źródłaPREVOST, DONALD. "Retines artificielles stochastiques : algorithmes et mise en uvre". Paris 11, 1995. http://www.theses.fr/1995PA112505.
Pełny tekst źródłaIssa, 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.
Pełny tekst źródłaKsiążki na temat "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.
Znajdź pełny tekst źródłaStrand, 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.
Znajdź pełny tekst źródłaMiclet, Laurent, Yves Kodratoff, Antoine Cornuéjols i Tom Mitchell. Apprentissage artificiel : Concepts et algorithmes. Eyrolles, 2002.
Znajdź pełny tekst źródłaCzęści książek na temat "Algorithmes de mise en cache"
Cole, Richard, i Vijaya Ramachandran. "Revisiting the Cache Miss Analysis of Multithreaded Algorithms". W LATIN 2012: Theoretical Informatics, 172–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29344-3_15.
Pełny tekst źródłaJoshi, Pallavi, M. V. Rathnamma, K. Srujan Raju i Urmila Pawar. "Miss Rate Estimation (MRE) an Novel Approach Toward L2 Cache Partitioning Algorithm’s for Multicore System". W Advances in Intelligent Systems and Computing, 593–603. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5400-1_58.
Pełny tekst źródłaFOUSSARD, Christian, i Cédric DENIS-RÉMIS. "Algorithme et maîtrise des risques". W Algorithmes et Société, 25–34. Editions des archives contemporaines, 2021. http://dx.doi.org/10.17184/eac.4552.
Pełny tekst źródłaVignale, François. "Crowdsourcing et bases de données". W Le Crowdsourcing, 105–16. Editions des archives contemporaines, 2021. http://dx.doi.org/10.17184/eac.3914.
Pełny tekst źródłaStreszczenia konferencji na temat "Algorithmes de mise en cache"
Cole, Richard, i Vijaya Ramachandran. "Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers". W 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.
Pełny tekst źródłaHou, Fang, i Yue-Long Zhao. "A cache management algorithm based on page miss cost". W 2009 International Conference on Information Engineering and Computer Science. ICIECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5364247.
Pełny tekst źródłaBergel, Itsik, i Soheil Mohajer. "Channel Aware Greedy Algorithm for MISO Cache-Aided Communication". W 2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC). IEEE, 2022. http://dx.doi.org/10.1109/spawc51304.2022.9834007.
Pełny tekst źródłaChang, Feng-Cheng, i Hsiang-Cheh Huang. "A Study on the Cache Miss Rate in a Genetic Algorithm Implementation". W 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.
Pełny tekst źródłaHyotaek Sh, Jaegeuk Kim, Dawoon Jung, Jin-Soo Kim i Seungryoul Maeng. "RMA: A Read Miss-Based Spin-Down Algorithm using an NV Cache". W 2008 IEEE International Conference on Computer Design. IEEE, 2008. http://dx.doi.org/10.1109/iccd.2008.4751910.
Pełny tekst źródłaSree Kumar, Ch, i Bhawani Shankar Pattnaik. "Miss rate analysis of cache oblivious matrix multiplication using sequential access recursive algorithm and normal multiplication algorithm". W 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.
Pełny tekst źródła