Letteratura scientifica selezionata sul tema "Comptage approximatif"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Indice
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Comptage approximatif".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Articoli di riviste sul tema "Comptage approximatif"
Parkkonen, Jouni, e Frédéric Paulin. "Équidistribution, comptage et approximation par irrationnels quadratiques". Journal of Modern Dynamics 6, n. 1 (2012): 1–40. http://dx.doi.org/10.3934/jmd.2012.6.1.
Testo completoOgien, Albert. "La Volonté de quantifier. Conceptions de la mesure de l'activité médicale". Annales. Histoire, Sciences Sociales 55, n. 2 (aprile 2000): 283–312. http://dx.doi.org/10.3406/ahess.2000.279847.
Testo completoBitat, Farid. "La Complicité Dans Les échanges Interpersonnels Et Leurs Compréhensions". مجلة المعيار 24, n. 1 (27 febbraio 2023): 835–42. http://dx.doi.org/10.37138/mieyar.v24i49.4728.
Testo completoSergent, Philippe, Jean-Michel Tanguy e Hassan Smaoui. "Calcul analytique et numérique des seiches et des oscillations portuaires pour des bassins de forme rectangulaire et de profondeur constante avec des digues semi-infinies parfaitement réfléchissantes". La Houille Blanche, n. 3-4 (ottobre 2019): 117–29. http://dx.doi.org/10.1051/lhb/2019049.
Testo completoMargolin, Jean-Claude. "Clarence H. Miller, Un fin connaisseur d’Érasme et de son temps". Moreana 35 (Number 135-, n. 3-4 (dicembre 1998): 111–28. http://dx.doi.org/10.3366/more.1998.35.3-4.8.
Testo completoWilliams Camus, Julia T. "An Approximation to the Ideological Basis of Metaphors Used for Cancer in the English and Spanish Press". FORUM / Revue internationale d’interprétation et de traduction / International Journal of Interpretation and Translation 7, n. 1 (1 aprile 2009): 171–201. http://dx.doi.org/10.1075/forum.7.1.08wil.
Testo completoDelorme, François, e Gaston Nadeau. "Un aperçu des lois de retour au travail adoptées au Québec entre 1964 et 2001". Relations industrielles 57, n. 4 (9 settembre 2003): 743–88. http://dx.doi.org/10.7202/006908ar.
Testo completoCervero, Ronald, e Arthur Wilson. "Beyond Learner-Centered Practice: Adult Education, Power, and Society". Canadian Journal for the Study of Adult Education 13, n. 2 (1 novembre 1999): 27–38. http://dx.doi.org/10.56105/cjsae.v13i2.1998.
Testo completoValeria, Osvaldo. "CARTOGRAPHIE PAR TELEDETECTION DE L’EVOLUTION DES PLANTATIONS RESINEUSES DANS L’EST DE LA FORÊT BOREALE CANADIENNE". Revue Française de Photogrammétrie et de Télédétection 1, n. 211-212 (6 dicembre 2015): 33–42. http://dx.doi.org/10.52638/rfpt.2015.539.
Testo completoCaselli, Graziella, e Gérard Calot. "Détermination d'une table de mortalité : la conversion des taux en quotients". Population Vol. 46, n. 6 (1 giugno 1991): 1441–90. http://dx.doi.org/10.3917/popu.p1991.46n6.1490.
Testo completoTesi sul tema "Comptage approximatif"
Ben, Mazziane Younes. "Analyse probabiliste pour le caching". Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ4014.
Testo completoCaches are small memories that speed up data retrieval. Caching policies may aim to choose cache content to minimize latency in responding to item requests. A more general problem permits an item's request to be approximately answered by a similar cached item. This concept, referred to as "similarity caching," proves valuable for content-based image retrieval and recommendation systems. The objective is to further minimize latency while delivering satisfactory answers.Theoretical understanding of cache memory management algorithms under specific assumptions on the requests provides guidelines for choosing a suitable algorithm. The Least-Frequently-Used (LFU) and the Least-Recently-Used (LRU) are popular caching eviction policies. LFU is efficient when the requests process is stationary, while LRU adapts to changes in the patterns of the requests. Online learning algorithms, such as the randomized Follow-the-Perturbed Leader (FPL) algorithm, applied for caching, enjoy worst-case guarantees. Both LFU and FPL rely on items' request count. However, counting is challenging in memory-constrained scenarios. To overcome this problem, caching policies operate with approximate counting schemes, such as the Count-Min Sketch with Conservative Updates (CMS-CU), to balance counts' accuracy and memory usage. In the similarity caching setting, RND-LRU is a modified LRU where a request is probabilistically answered by the most similar cached item. Unfortunately, a theoretical analysis of an LFU cache utilizing CMS-CU, an FPL cache with an approximate counting algorithm, and RND-LRU remains difficult.This thesis investigates three randomized algorithms: CMS-CU, FPL with noisy items' request counts estimations (NFPL), and RND-LRU. For CMS-CU, we propose a novel approach to derive new upper bounds on the expected value and the complementary cumulative distribution function of the estimation error under a renewal request process. Additionally, we prove that NFPL behaves as well as the optimal omniscient static caching policy for any request sequence under specific conditions on the noisy counts. Finally, we introduce a new analytically tractable similarity caching policy and show that it can approximate RND-LRU
Zou, Tingxiang. "Structures pseudo-finies et dimensions de comptage". Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1083/document.
Testo completoThis thesis is about the model theory of pseudofinite structures with the focus on groups and fields. The aim is to deepen our understanding of how pseudofinite counting dimensions can interact with the algebraic properties of underlying structures and how we could classify certain classes of structures according to their counting dimensions. Our approach is by studying examples. We treat three classes of structures: The first one is the class of H-structures, which are generic expansions of existing structures. We give an explicit construction of pseudofinite H-structures as ultraproducts of finite structures. The second one is the class of finite difference fields. We study properties of coarse pseudofinite dimension in this class, show that it is definable and integer-valued and build a partial connection between this dimension and transformal transcendence degree. The third example is the class of pseudofinite primitive permutation groups. We generalise Hrushovski's classical classification theorem for stable permutation groups acting on a strongly minimal set to the case where there exists an abstract notion of dimension, which includes both the classical model theoretic ranks and pseudofinite counting dimensions. In this thesis, we also generalise Schlichting's theorem for groups to the case of approximate subgroups with a notion of commensurability
Kaoutar, Mustapha. "Approximation linéaire par morceaux : application au comptage de pas de barres d'un réacteur nucléaire et à la caractérisation des contours d'images". Paris 11, 1986. http://www.theses.fr/1986PA112125.
Testo completoAfter a survey of main algorithms for piecewise linear approximation, a new method is suggested. Its consists of two stages: - a sequential detection stage, - an optimization stage, which derives from general dynamic clustering principle. It is applied to control rod step counting in a nuclear reactor core and images contours characterization. Another version of our method is presented. Its originality comes from the variability of the line segments number during iterations. A comparative study is made by comparing the results of the proposed method with of another methods already existing thereby it attests the efficiency and reliability of our methods
Kaoutar, Mustapha. "Approximation linéaire par morceaux application au comptage de pas de barres d'un réacteur nucléaire et à la caractérisation des contours d'images". Grenoble 2 : ANRT, 1986. http://catalogue.bnf.fr/ark:/12148/cb375986370.
Testo completoSabatier, Robert. "Méthodes factorielles en analyse des données : approximation et prise en compte de variables concomitantes". Montpellier 2, 1987. http://www.theses.fr/1987MON20256.
Testo completoVermet, Mikaël. "Simulations par l'acoustique géométrique en présence de surfaces courbes avec prise en compte de la diffraction". Poitiers, 2010. http://theses.edel.univ-poitiers.fr/theses/2010/Vermet-Mikael/2010-Vermet-Mikael-These.pdf.
Testo completoWe present in this thesis some improvements of acoustical pressure prediction by ray-based methods involving curved surfaces. The framework is an adaptative beam tracing algorithm. The first part deals with diffraction by obstacles. First we solve the problem of successive wedges diffractions. Then we extend this problem to creeping waves calculation on curved surfaces using an appropriate and frequency independant tesselation of these surfaces. The reconstruction of continuous and derivable surfaces from meshes to improve reections computation is treated in the second part. These surfaces have to be suitable for ray tracing technics. Starting from Powell-Sabin splines we extend its use to any kind of surfaces. This implies different projection planes that creates holes on the surfaces. We show that these gaps can be filled with polynomial implicit surfaces of degree four ; consequently their intersections with rays can calculated analytically
Dehghan, Kaveh. "Prise en compte d'une anisotropie réaliste dans l'imagerie sismique des zones complexes". Paris, Institut de physique du globe, 2007. http://www.theses.fr/2007GLOB0015.
Testo completoLardin, Pauline. "Estimation de synchrones de consommation électrique par sondage et prise en compte d'information auxiliaire". Phd thesis, Université de Bourgogne, 2012. http://tel.archives-ouvertes.fr/tel-00842199.
Testo completoHabibi, Muhammad Khoirul Khakim. "Optimisation d'une chaîne logistique inverse avec la prise en compte des processus de désassemblage". Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEM005.
Testo completoThis dissertation supports and proposes better management in the implementation of the cir-cular economy by integrating activities of reverse supply chains. The hypothesis states thatintegrating decisions of at least two activities in reverse supply chain leads to better decisionsnotably the collection of End-of-Life products and their disassembly.A deterministic problem, called Collection-Disassembly Problem, integrating both collectionand disassembly processes as well as its formulation are introduced and developed. Due to lackof available instances in the literature, some instances are generated. Another non-integratedformulation is developed and solved using the commercial solver CPLEX. The obtained resultsshow that the integrated model proposes better decisions in terms of total cost. Some ap-proximate methods are developed because the commercial solver CPLEX is unable to provideoptimal solutions under acceptable CPU times notably for large size instances.An extended version of the problem is introduced due to the fact that reverse supply chainsfrequently deal with the uncertainty of certain parameters such as the quality and the quantityof End-of-Life products as well as the demands of components. Also, there is often more thanone vehicle available to collect the products. Thus, this second problem suggested which is calledStochastic Multi-Vehicle Collection-Disassembly Problem and its formulation is developed. Theproblem is formalised as two-stage stochastic programming by assuming that the parametersunder uncertainty follow some known probability distributions and their realisation comes afterthe planning stage. To provide the solutions, two methods combined with an algorithmicframework of Sample Average Approximation are developed.Another problem called Integrated Procurement-Disassembly Problem is also studied. Alongwith the decisions on collection process, this problem emphasises on the decisions of disassemblyline balancing problem
Loubier, Eloïse. "Analyse et visualisation de données relationnelles par morphing de graphe prenant en compte la dimension temporelle". Phd thesis, Université Paul Sabatier - Toulouse III, 2009. http://tel.archives-ouvertes.fr/tel-00423655.
Testo completoNos travaux conduisent à l'élaboration des techniques graphiques permettant la compréhension des activités humaines, de leurs interactions mais aussi de leur évolution, dans une perspective décisionnelle. Nous concevons un outil alliant simplicité d'utilisation et précision d'analyse se basant sur deux types de visualisations complémentaires : statique et dynamique.
L'aspect statique de notre modèle de visualisation repose sur un espace de représentation, dans lequel les préceptes de la théorie des graphes sont appliqués. Le recours à des sémiologies spécifiques telles que le choix de formes de représentation, de granularité, de couleurs significatives permet une visualisation plus juste et plus précise de l'ensemble des données. L'utilisateur étant au cœur de nos préoccupations, notre contribution repose sur l'apport de fonctionnalités spécifiques, qui favorisent l'identification et l'analyse détaillée de structures de graphes. Nous proposons des algorithmes qui permettent de cibler le rôle des données au sein de la structure, d'analyser leur voisinage, tels que le filtrage, le k-core, la transitivité, de retourner aux documents sources, de partitionner le graphe ou de se focaliser sur ses spécificités structurelles.
Une caractéristique majeure des données stratégiques est leur forte évolutivité. Or l'analyse statistique ne permet pas toujours d'étudier cette composante, d'anticiper les risques encourus, d'identifier l'origine d'une tendance, d'observer les acteurs ou termes ayant un rôle décisif au cœur de structures évolutives.
Le point majeur de notre contribution pour les graphes dynamiques représentant des données à la fois relationnelles et temporelles, est le morphing de graphe. L'objectif est de faire ressortir les tendances significatives en se basant sur la représentation, dans un premier temps, d'un graphe global toutes périodes confondues puis en réalisant une animation entre les visualisations successives des graphes attachés à chaque période. Ce procédé permet d'identifier des structures ou des événements, de les situer temporellement et d'en faire une lecture prédictive.
Ainsi notre contribution permet la représentation des informations, et plus particulièrement l'identification, l'analyse et la restitution des structures stratégiques sous jacentes qui relient entre eux et à des moments donnés les acteurs d'un domaine, les mots-clés et concepts qu'ils utilisent.
Libri sul tema "Comptage approximatif"
Kaoutar, Mustapha. Approximation linéaire par morceaux: Application au comptage de pas de barres d'un réacteur nucléaire et à la caracterisation des contours d'images. 1986.
Cerca il testo completo