Littérature scientifique sur le sujet « Génération automatique de benchmarks »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Génération automatique de benchmarks ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Génération automatique de benchmarks"
Balpe, Jean-Pierre. « Théorie du lexique en génération automatique ». Linx 4, no 1 (1991) : 233–47. http://dx.doi.org/10.3406/linx.1991.1200.
Texte intégralDanlos, Laurence. « Génération automatique de textes en langue naturelle ». Annales Des Télécommunications 44, no 1-2 (janvier 1989) : 94–100. http://dx.doi.org/10.1007/bf02999881.
Texte intégralDanlos, Laurence. « Génération automatique de textes en langue naturelle ». Linx 4, no 1 (1991) : 197–214. http://dx.doi.org/10.3406/linx.1991.1198.
Texte intégralDanlos, Laurence. « Un survol des recherches en génération automatique ». Revue québécoise de linguistique 14, no 2 (1985) : 65. http://dx.doi.org/10.7202/602539ar.
Texte intégral-JÉRON, T. « Génération automatique de tests pour les protocoles ». Revue de l'Electricité et de l'Electronique -, no 03 (1999) : 84. http://dx.doi.org/10.3845/ree.1999.033.
Texte intégralGross, Gaston, et André Clas. « Synonymie, polysémie et classes d'objets ». Meta 42, no 1 (30 septembre 2002) : 147–54. http://dx.doi.org/10.7202/002977ar.
Texte intégralContant, Chantal. « Génération automatique de rapports boursiers français et anglais ». Revue québécoise de linguistique 17, no 1 (12 mai 2009) : 197–221. http://dx.doi.org/10.7202/602620ar.
Texte intégralMartin, Philippe. « Génération automatique de la structure prosodique en français ». Journal of Speech Sciences 7, no 2 (20 septembre 2019) : 79–91. http://dx.doi.org/10.20396/joss.v7i2.15002.
Texte intégralNault, Georges. « Vers une théorie du récit automatique ». Cinémas 2, no 1 (8 mars 2011) : 137–48. http://dx.doi.org/10.7202/1001055ar.
Texte intégralZock, Michael, et Gérard Sabah. « La génération automatique de textes : trente ans déjà, ou presque ». Langages 26, no 106 (1992) : 8–35. http://dx.doi.org/10.3406/lgge.1992.1630.
Texte intégralThèses sur le sujet "Génération automatique de benchmarks"
Schmitt, Maxime. « Génération automatique de codes adaptatifs ». Thesis, Strasbourg, 2019. http://www.theses.fr/2019STRAD029.
Texte intégralIn this thesis we introduce a new application programming interface to help developers to optimize an application with approximate computing techniques. This interface is provided as a language extension to advise the compiler about the parts of the program that may be optimized with approximate computing and what can be done about them. The code transformations of the targeted regions are entirely handled by the compiler to produce an adaptive software. The produced adaptive application allocates more computing power to the locations where more precision is required, and may use approximations where the precision is secondary. We automate the discovery of the optimization parameters for the special class of stencil programs which are common in signal/image processing and numerical simulations. Finally, we explore the possibility of compressing the application data using the wavelet transform and we use information found in this basis to locate the areas where more precision may be needed
Thiéblin, Elodie. « Génération automatique d'alignements complexes d'ontologies ». Thesis, Toulouse 3, 2019. http://www.theses.fr/2019TOU30135.
Texte intégralThe Linked Open Data (LOD) cloud is composed of data repositories. The data in the repositories are described by vocabularies also called ontologies. Each ontology has its own terminology and model. This leads to heterogeneity between them. To make the ontologies and the data they describe interoperable, ontology alignments establish correspondences, or links between their entities. There are many ontology matching systems which generate simple alignments, i.e., they link an entity to another. However, to overcome the ontology heterogeneity, more expressive correspondences are sometimes needed. Finding this kind of correspondence is a fastidious task that can be automated. In this thesis, an automatic complex matching approach based on a user's knowledge needs and common instances is proposed. The complex alignment field is still growing and little work address the evaluation of such alignments. To palliate this lack, we propose an automatic complex alignment evaluation system. This system is based on instances. A famous alignment evaluation dataset has been extended for this evaluation
El, Amrani Younès. « Génération automatique d'interfaces pour langages fonctionnels ». Orléans, 1996. http://www.theses.fr/1996ORLE2074.
Texte intégralTachon, Thibaut. « Génération automatique de code parallèle isochrone ». Thesis, Orléans, 2019. http://www.theses.fr/2019ORLE3098.
Texte intégralSince we are in an era of processor clock stagnation, computing power growth has been relying on parallel computing. More than the algorithmic difficulty involved in any program writing, parallel computing additionally requires the programmer to manage numerous processing units including their tasks and interactions. In order to alleviate the parallel programmer’s burden, this thesis proposes two different approaches for automatic parallel code generation. The bulk-synchronous parallel (BSP) model provides good properties such as its cost model and is therefore chosen as the target of our parallel code generation.Automata and regular expressions are often chosen to model sequential computation and their parallelization will lead to a strong foundation for general parallel code generation. For our main approach, we develop the theory of BSP automata with their generation and determinization. This theory is used in a novel method for parallel regular expression matching.As another approach, we propose a domain specific language for programming neural nets where the functional composition of only a few primitives eases development, maintenance and formal definition of the language compared to existing approaches
Abdollahi, Nika. « B cell receptor repertoire analysis in clinical context : new approaches for clonal grouping, intra-clonal diversity studies, and repertoire visualization ». Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS063.
Texte intégralNext-generation sequencing has enabled researchers to conduct in-depth analyses of the immunological repertoire landscape. However, a significant concern in these studies is the computational cost of analyzing millions of sequences with inherent complexity, variability, and mutational capacity, imposing computational challenges and necessitating the development of efficient methods. This challenge is even more evident in the clinical context that does not necessarily have access to professionals with computing skills or robust computational resources. Thus, the main goal of this thesis is to develop a set of dedicated and integrated tools to be used in the clinical environment, for medical diagnostic and patient care, and in the research environment, to perform large-scale and in-depth repertoire analysis. We have designed and implemented multiple algorithms and gathered them in a user-friendly interactive BCR repertoire visualization pipeline to facilitate the process of integrating BCR repertoire analysis into medical practices
Colin, Émilie. « Traitement automatique des langues et génération automatique d'exercices de grammaire ». Electronic Thesis or Diss., Université de Lorraine, 2020. http://www.theses.fr/2020LORR0059.
Texte intégralOur perspectives are educational, to create grammar exercises for French. Paraphrasing is an operation of reformulation. Our work tends to attest that sequence-to-sequence models are not simple repeaters but can learn syntax. First, by combining various models, we have shown that the representation of information in multiple forms (using formal data (RDF), coupled with text to extend or reduce it, or only text) allows us to exploit a corpus from different angles, increasing the diversity of outputs, exploiting the syntactic levers put in place. We also addressed a recurrent problem, that of data quality, and obtained paraphrases with a high syntactic adequacy (up to 98% coverage of the demand) and a very good linguistic level. We obtain up to 83.97 points of BLEU-4*, 78.41 more than our baseline average, without syntax leverage. This rate indicates a better control of the outputs, which are varied and of good quality in the absence of syntax leverage. Our idea was to be able to work from raw text : to produce a representation of its meaning. The transition to French text was also an imperative for us. Working from plain text, by automating the procedures, allowed us to create a corpus of more than 450,000 sentence/representation pairs, thanks to which we learned to generate massively correct texts (92% on qualitative validation). Anonymizing everything that is not functional contributed significantly to the quality of the results (68.31 of BLEU, i.e. +3.96 compared to the baseline, which was the generation of text from non-anonymized data). This second work can be applied the integration of a syntax lever guiding the outputs. What was our baseline at time 1 (generate without constraint) would then be combined with a constrained model. By applying an error search, this would allow the constitution of a silver base associating representations to texts. This base could then be multiplied by a reapplication of a generation under constraint, and thus achieve the applied objective of the thesis. The formal representation of information in a language-specific framework is a challenging task. This thesis offers some ideas on how to automate this operation. Moreover, we were only able to process relatively short sentences. The use of more recent neural modelswould likely improve the results. The use of appropriate output strokes would allow for extensive checks. *BLEU : quality of a text (scale from 0 (worst) to 100 (best), Papineni et al. (2002))
Saggion, Horacio. « Génération automatique de résumés par analyse sélective ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0017/NQ55476.pdf.
Texte intégralTerrillon, Guillaume. « Spécification et génération automatique de sites Internet ». Mémoire, Université de Sherbrooke, 2005. http://savoirs.usherbrooke.ca/handle/11143/4702.
Texte intégralMartin, Kevin. « Génération automatique d'extensions de jeux d'instructions de processeurs ». Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00526133.
Texte intégralHankach, Pierre. « Génération automatique de textes par satisfaction de contraintes ». Paris 7, 2009. http://www.theses.fr/2009PA070027.
Texte intégralWe address in this thesis the construction of a natural language generation System - computer software that transforms a formal representation of information into a text in natural language. In our approach, we define the generation problem as a constraint satisfaction problem (CSP). The implemented System ensures an integrated processing of generation operations as their different dependencies are taken into account and no priority is given to any type of operation over the others. In order to define the constraint satisfaction problem, we represent the construction operations of a text by decision variables. Individual operations that implement the same type of minimal expressions in the text form a generation task. We classify decision variables according to the type of operations they represent (e. G. Content selection variables, document structuring variables. . . ). The linguistic rules that govern the operations are represented as constraints on the variables. A constraint can be defined over variables of the same type or different types, capturing the dependency between the corresponding operations. The production of a text consists of resolving the global System of constraints, that is finding an evaluation of the variables that satisfies all the constraints. As part of the grammar of constraints for generation, we particularly formulate the constraints that govern document structuring operations. We model by constraints the rhetorical structure of SORT in order to yield coherent texts as the generator's output. Beforehand, in order to increase the generation capacities of our System, we extend the rhetorical structure to cover texts in the non-canonical order. Furthermore, in addition to defining these coherence constraints, we formulate a set of constraints that enables controlling the form of the macrostructure by communicative goals. Finally, we propose a solution to the problem of computational complexity of generating large texts. This solution is based on the generation of a text by groups of clauses. The problem of generating a text is therefore divided into many problems of reduced complexity, where each of them is concerned with generating a part of the text. These parts are of limited size so the associated complexity to their generation remains reasonable. The proposed partitioning of generation is motivated by linguistic considerations
Livres sur le sujet "Génération automatique de benchmarks"
George. Génération automatique de maillages : Applications aux méthodes d'éléments finis. Dunod, 1997.
Trouver le texte intégralLandrault, Alexis. Génération Automatique de Circuits Cmos À L'Aide de Cellule Virtuelle. International Book Market Service Ltd., 2011.
Trouver le texte intégralauthor, Cook Mike, dir. Twitterbots : Making machines that make meaning. The MIT Press, 2018.
Trouver le texte intégralKeyhani, Ali. Design of Smart Power Grid Renewable Energy Systems. Wiley & Sons, Incorporated, John, 2012.
Trouver le texte intégralKeyhani, Ali. Design of Smart Power Grid Renewable Energy Systems. Wiley & Sons, Incorporated, John, 2016.
Trouver le texte intégralKeyhani, Ali. Design of Smart Power Grid Renewable Energy Systems. Wiley & Sons, Incorporated, John, 2016.
Trouver le texte intégralKeyhani, Ali. Design of Smart Power Grid Renewable Energy Systems. Wiley & Sons, Incorporated, John, 2011.
Trouver le texte intégralKeyhani, Ali. Design of Smart Power Grid Renewable Energy Systems. Wiley & Sons, Incorporated, John, 2016.
Trouver le texte intégralKeyhani, Ali. Design of Smart Power Grid Renewable Energy Systems. Wiley & Sons, Incorporated, John, 2019.
Trouver le texte intégralKeyhani, Ali. Design of Smart Power Grid Renewable Energy Systems. Wiley & Sons, Incorporated, John, 2011.
Trouver le texte intégralChapitres de livres sur le sujet "Génération automatique de benchmarks"
Cardey, Sylviane, et Peter Greenfield. « Génération automatique de déterminants en allemand ». Dans Lingvisticæ Investigationes Supplementa, 115. Amsterdam : John Benjamins Publishing Company, 2001. http://dx.doi.org/10.1075/lis.23.10car.
Texte intégralRhissassi, Habib, et Alain Lelu. « Projet Hypermap : Pour un environnement complet de génération automatique d'hypertexte ». Dans Electronic Publishing, Artistic Imaging, and Digital Typography, 537–49. Berlin, Heidelberg : Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053298.
Texte intégral« Outils de génération automatique des modèles ». Dans Conception de bases de données avec UML, 447–504. Presses de l'Université du Québec, 2007. http://dx.doi.org/10.2307/j.ctv18pgv5t.10.
Texte intégralDUPONT DE DINECHIN, Benoît. « Une approche qualitative de l’architecture pluricoeur ». Dans Systèmes multiprocesseurs sur puce 1, 43–72. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9021.ch2.
Texte intégralŠMILAUER, Ivan. « La conjugaison tchèque à l’usage des machines et des hommes : quelques réflexions ». Dans Des langues calculables à l'homme incalculable, 165–76. Editions des archives contemporaines, 2021. http://dx.doi.org/10.17184/eac.5273.
Texte intégralActes de conférences sur le sujet "Génération automatique de benchmarks"
Chevalier, Marcel, Laurent Buchsbaum, Yoann Robin et Gaël Le Godais. « Génération automatique de réseaux de Petri à partir de réseaux électriques ». Dans Congrès Lambda Mu 20 de Maîtrise des Risques et de Sûreté de Fonctionnement, 11-13 Octobre 2016, Saint Malo, France. IMdR, 2016. http://dx.doi.org/10.4267/2042/61815.
Texte intégralCosnard, Paul M., J. Duprat, A. Guyot, B. Hochet, J. M. Muller, H. Ouaouicha et E. Zysman. « Etude et Conception de la Machine de Communication du Coprocesseur Felin ». Dans Simpósio Brasileiro de Arquitetura de Computadores e Processamento Paralelo. Sociedade Brasileira de Computação, 1987. http://dx.doi.org/10.5753/sbac-pad.1987.23596.
Texte intégral