Gotowa bibliografia na temat „Réduction de la complexité de calcul”
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 „Réduction de la complexité de calcul”.
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 "Réduction de la complexité de calcul"
Belaubre, Gilbert. "Approches méthodologiques et expérimentales des phénomènes complexes". Acta Europeana Systemica 4 (14.07.2020): 143–64. http://dx.doi.org/10.14428/aes.v4i1.57343.
Pełny tekst źródłaPoizat, Bruno. "Une dualité entre fonctions booléennes". Journal of the Institute of Mathematics of Jussieu 9, nr 3 (26.04.2010): 633–52. http://dx.doi.org/10.1017/s1474748010000083.
Pełny tekst źródłaRomero, Clara. "Comment le sens peut-il être complexe ? L’exemple des comparaisons d’intensité". Nouvelles perspectives en sciences sociales 9, nr 1 (27.03.2014): 171–98. http://dx.doi.org/10.7202/1024041ar.
Pełny tekst źródłaGiraud, Olivier. "La comparaison comme opération de réduction de la complexité." Revue internationale de politique comparée 11, nr 3 (2004): 349. http://dx.doi.org/10.3917/ripc.113.0349.
Pełny tekst źródłaDelay, Frédérick, i Philippe Ackerer. "The reduction of hydrological models for less tedious practical applications". Annales de la Société Géologique du Nord, nr 22 (1.12.2015): 29–40. http://dx.doi.org/10.54563/asgn.1018.
Pełny tekst źródłaIbrahim, Amr Helmy. "Une mesure unifiée de la complexité linguistique : l’analyse matricielle définitoire". Nouvelles perspectives en sciences sociales 9, nr 1 (27.03.2014): 17–80. http://dx.doi.org/10.7202/1024038ar.
Pełny tekst źródłaM’Raoui, Abdelhamid. "Méthode de réduction pour le calcul des paramètres de l’équation caractéristique d’un module photovoltaïque". Journal of Renewable Energies 21, nr 4 (31.12.2018): 505–14. http://dx.doi.org/10.54966/jreen.v21i4.708.
Pełny tekst źródłaTeyssier, Corinne, Hélène Marchandin i Estelle Jumas-Bilak. "Le génome des alpha-protéobactéries : complexité, réduction, diversité et fluidité". Canadian Journal of Microbiology 50, nr 6 (1.06.2004): 383–96. http://dx.doi.org/10.1139/w04-033.
Pełny tekst źródłaBermejo, Isabel, i Monique Lejeune-Jalabert. "Sur la complexité du calcul des projections d'une courbe projective". Communications in Algebra 27, nr 7 (styczeń 1999): 3211–20. http://dx.doi.org/10.1080/00927879908826623.
Pełny tekst źródłaFuchs, F., B. Lespinasse, A. Lorente, A. Benassaya, B. Goral, N. Talazac, N. Rampnoux, C. Pagotto, E. Gomez i H. Fenet. "Agir contre les micropolluants issus des établissements de soin : un exemple de démarche concertée entre Montpellier Méditerranée Métropole et la Polyclinique Saint-Roch (Montpellier)". Techniques Sciences Méthodes, nr 7-8 (lipiec 2019): 93–103. http://dx.doi.org/10.1051/tsm/201907093.
Pełny tekst źródłaRozprawy doktorskie na temat "Réduction de la complexité de calcul"
Rouat, Valérie. "Validité de l'approche classification dans la réduction statistique de la complexité de #SAT". Rennes 1, 1999. http://www.theses.fr/1999REN10021.
Pełny tekst źródłaBarbanchon, Régis. "Réductions fines entre problèmes NP-complets : linéarité, planarité, parcimonie, et minimalité logique". Caen, 2003. http://www.theses.fr/2003CAEN2066.
Pełny tekst źródłaBerthomieu, Jérémy. "Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités ; implantations". Phd thesis, Palaiseau, Ecole polytechnique, 2011. https://theses.hal.science/docs/00/67/19/68/PDF/Main.pdf.
Pełny tekst źródłaThis PhD thesis deals with some particular aspects of the algebraic systems resolution. Firstly, we introduce a way of minimizing the number of additive variables appearing in an algebraic system. For this, we make use of two invariants of variety introduced by Hironaka: the ridge and the directrix. Then, we propose fast arithmetic routines, the so-called relaxed routines, for p-adic integers. These routines allow us, then, to solve efficiently an algebraic system with rational coefficients locally, i. E. Over the p-adic integers. In a fourth part, we are interested in the factorization of a bivariate polynomial, which is at the root of the decomposition of hypersurfaces into irreducible components. We propose an algorithm reducing the factorization of the input polynomial to that of a polynomial whose dense size is essentially equivalent to the convex-dense size of the input polynomial. In the last part, we consider real algebraic systems solving in average. We design a probabilistic algorithm computing an approximate complex zero of the real algebraic system given as input
Berthomieu, Jérémy. "Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités ; implantations". Phd thesis, Ecole Polytechnique X, 2011. http://pastel.archives-ouvertes.fr/pastel-00670436.
Pełny tekst źródłaStehlé, Damien. "Algorithmique de la réduction de réseaux et application à la recherche de pires cas pour l'arrondi defonctions mathématiques". Phd thesis, Université Henri Poincaré - Nancy I, 2005. http://tel.archives-ouvertes.fr/tel-00011150.
Pełny tekst źródłaplusieurs domaines de l'algorithmique, en cryptographie et en théorie
algorithmique des nombres par exemple. L'objet du présent mémoire est dual : nous améliorons les algorithmes de réduction des réseaux,
et nous développons une nouvelle application dans le domaine
de l'arithmétique des ordinateurs. En ce qui concerne l'aspect algorithmique, nous nous intéressons aux cas des petites dimensions (en dimension un, où il s'agit du calcul de pgcd, et aussi en dimensions 2 à 4), ainsi qu'à la description d'une nouvelle variante de l'algorithme LLL, en dimension quelconque. Du point de vue de l'application, nous utilisons la méthode
de Coppersmith permettant de trouver les petites racines de polynômes modulaires multivariés, pour calculer les pires cas pour l'arrondi des fonctions mathématiques, quand la fonction, le mode d'arrondi, et la précision sont donnés. Nous adaptons aussi notre technique aux mauvais cas simultanés pour deux fonctions. Ces deux méthodes sont des pré-calculs coûteux, qui une fois
effectués permettent d'accélérer les implantations des fonctions mathématiques élémentaires en précision fixée, par exemple en double précision.
La plupart des algorithmes décrits dans ce mémoire ont été validés
expérimentalement par des implantations, qui sont
disponibles à l'url http://www.loria.fr/~stehle.
Shahkarami, Abtin. "Complexity reduction over bi-RNN-based Kerr nonlinearity equalization in dual-polarization fiber-optic communications via a CRNN-based approach". Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAT034.
Pełny tekst źródłaThe impairments arising from the Kerr nonlinearity in optical fibers limit the achievable information rates in fiber-optic communication. Unlike linear effects, such as chromatic dispersion and polarization-mode dispersion, which can be compensated via relatively simple linear equalization at the receiver, the computational complexity of the conventional nonlinearity mitigation techniques, such as the digital backpropagation, can be substantial. Neural networks have recently attracted attention, in this context, for low-complexity nonlinearity mitigation in fiber-optic communications. This Ph.D. dissertation deals with investigating the recurrent neural networks to efficiently compensate for the nonlinear channel impairments in dual-polarization long-haul fiber-optic transmission. We present a hybrid convolutional recurrent neural network (CRNN) architecture, comprising a convolutional neural network (CNN) -based encoder followed by a recurrent layer working in tandem. The CNN-based encoder represents the shortterm channel memory arising from the chromatic dispersion efficiently, while transitioning the signal to a latent space with fewer relevant features. The subsequent recurrent layer is implemented in the form of a unidirectional vanilla RNN, responsible for capturing the long-range interactions neglected by the CNN encoder. We demonstrate that the proposed CRNN achieves the performance of the state-of-theart equalizers in optical fiber communication, with significantly lower computational complexity depending on the system model. Finally, the performance complexity trade-off is established for a number of models, including multi-layer fully-connected neural networks, CNNs, bidirectional recurrent neural networks, bidirectional long short-term memory (bi-LSTM), bidirectional gated recurrent units, convolutional bi-LSTM models, and the suggested hybrid model
Guiraud, Maël. "Ordonnancement periodiques de messages pour minimiser la latence dans les réseaux dans un contexte 5G et au delà". Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG034.
Pełny tekst źródłaThis thesis is the result of a collaboration between DAVID Laboratory and Nokia Bell Labs France.The original idea is to find algorithmic solutions to deterministically manage periodic flows in networks in order to control and minimize the transmission time, called latency. One of the objectives of 5G (C-RAN, for Cloud Radio Access Network) is to centralize the calculation units of the radio antennas of telecommunications networks (called Radio Access Network) in the same computer center (the Cloud). The network between the computing center and the antennas must be able to satisfy the latency constraints imposed by the protocols.We define the problem of finding a periodic scheduling for messages so that they never compete for the same resource, and prove that the different variants of the problem studied are NP-complete. We first study the problem for a particular topology in which all the streams share the same link. We first propose polynomial algorithms of increased sophistication, and FPT algorithms that allow us to find a solution when the number of routes is reasonable, which is the case for C-RAN networks.Since the algorithms developed in this first part are not directly adaptable to more general topologies, we then propose a canonical form to the problem which allows us to define an efficient neighborhood notion for local search heuristics (hill climbing, tabu search, simulated annealing). We use this canonical form to define an efficient Branch and Bound algorithm when the number of routes is moderate.We also propose a performance evaluation of the proposed solutions compared to current flow management solutions, and show that our model is feasible in practice thanks to new equipment under development
Cagniart, Nicolas. "Quelques approches non linéaires en réduction de complexité". Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUS194/document.
Pełny tekst źródłaModel reduction methods provide a general framework for substantially reducing computational costs of numerical simulations. In this thesis, we propose to extend the scope of these methods. The common point of the topics discussed here is the attempt to go beyond the standard linear "reduced basis" framework, which only deals with cases where the solution manifold have a small Kolmogorov width. We shall see how truncate, translate, rotate, stretch, compress etc. and then recombine the solutions, can sometimes help to overcome the problem when this Kolmogorov width is not small. We will also discuss the need for tailor-made stabilisation methods for the reduced frame
Madet, Antoine. "Complexité implicite dans des Lambda -calculs concurrents". Paris 7, 2012. http://www.theses.fr/2012PA077222.
Pełny tekst źródłaControlling the resource consumption of programs is crucial: besides performance reasons, it has many applications in the field of computer security where e. G. Mobile or embedded Systems dispose of limited amounts of resources. In this thesis, we develop static criteria to control the resource consumption of higher-order concurrent programs. Our starting point is the framework of Light Logics which has been extensively studied to control the complexity of higher-order functional programs through the proofs-as-programs correspondent. The contribution of this thesis is to extend this framework to higher-order concurrent programs. More generally, this thesis fits in the research field of Implicit Computational Complexity which aims at characterizing complexity classes by logical principles or language restrictions. The criteria that we propose are purely syntactic and are developed gradually to control the computational time of programs in a finer and finer way: first, we show how to guarantee the termination of programs (finite time); then, we show how to guarantee the termination of programs in elementary time and last, we show how to guarantee the termination of programs in polynomial time. We also introduce type Systems so that well-typed programs are guaranteed to terminate in bounded time and to return values. Finally, we show that the type Systems capture some interesting concurrent programs that iterate functions producing side effects over inductive data structures. In the last part, we study an alternative semantic method to control the resource consumption of higher-order imperative programs. The method is based on Dal Lago and Hofmann's quantitative realizability framework and allows to obtain various complexity bounds in a uniform way. This last par is joint work with Aloïs Brunel
Ayad, Ali. "Complexité de résolution de systèmes algébriques paramétrés". Rennes 1, 2006. https://tel.archives-ouvertes.fr/tel-00127383.
Pełny tekst źródłaKsiążki na temat "Réduction de la complexité de calcul"
Wilf, Herbert S. Algorithmes et complexité. Paris: Masson, 1989.
Znajdź pełny tekst źródłaLuhmann, Niklas. La confiance: Un mécanisme de réduction de la complexité sociale. Paris: Economica, 2006.
Znajdź pełny tekst źródłaL, Selman Alan, red. Structure in complexity theory: Proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986. Berlin: Springer-Verlag, 1986.
Znajdź pełny tekst źródłaScandinavian Workshop on Algorithm Theory (7th 2000 Bergen, Norway). Algorithm theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 5-7, 2000 ; proceedings. Berlin: Springer, 2000.
Znajdź pełny tekst źródłaScandinavian Workshop on Algorithm Theory (7th 2000 Bergen, Norway). Algorithm theory-- SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000 : proceedings. Berlin: Springer, 2000.
Znajdź pełny tekst źródłaComplexity and postmodernism: Understanding complex systems. London: Routledge, 1998.
Znajdź pełny tekst źródłaInternational Meeting of Young Computer Scientists (5th 1988 Smolenice, Slovakia). Machines, languages, and complexity. Berlin: Springer-Verlag, 1989.
Znajdź pełny tekst źródłaR, Carson Ewart, red. Dealing with complexity: An introduction to the theory and application of systems science. New York: Plenum Press, 1988.
Znajdź pełny tekst źródłaFlood, Robert L. Dealingwith complexity: An introduction to the theory and application of systems science. New York: Plenum, 1988.
Znajdź pełny tekst źródłaFlood, Robert L. Dealing with complexity: An introduction to the theory and application of systems science. Wyd. 2. New York: Plenum Press, 1993.
Znajdź pełny tekst źródłaCzęści książek na temat "Réduction de la complexité de calcul"
"Chapitre 3 Calculabilité et complexité". W Physique quantique, information et calcul, 85–134. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2413-7-007.
Pełny tekst źródła"Chapitre 3 Calculabilité et complexité". W Physique quantique, information et calcul, 85–134. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2413-7.c007.
Pełny tekst źródłaLIBERGE, Erwan. "Calcul d’écoulements hydrodynamiques : méthodes LBM et POD". W Interactions fluide-structure, 119–52. ISTE Group, 2022. http://dx.doi.org/10.51926/iste.9078.ch5.
Pełny tekst źródłaLEBLOND, Cédric. "Méthodes « avancées » en vibro-acoustique des structures navales". W Interactions fluide-structure, 87–118. ISTE Group, 2022. http://dx.doi.org/10.51926/iste.9078.ch4.
Pełny tekst źródłaCALVET, Louis-Jean. "Quels liens entre langues et mondialisation ?" W Langue(s) en mondialisation, 7–14. Editions des archives contemporaines, 2022. http://dx.doi.org/10.17184/eac.5202.
Pełny tekst źródłaProost, Stef. "Calcul des coûts et avantages de la réduction des émissions de CO2 dans le secteur des transports". W Le coût et l'efficacité des mesures visant à réduire les émissions des véhicules, 167–90. OECD, 2008. http://dx.doi.org/10.1787/9789282102152-6-fr.
Pełny tekst źródłaRaporty organizacyjne na temat "Réduction de la complexité de calcul"
Dufour, Quentin, David Pontille i Didier Torny. Contracter à l’heure de la publication en accès ouvert. Une analyse systématique des accords transformants. Ministère de l'enseignement supérieur et de la recherche, kwiecień 2021. http://dx.doi.org/10.52949/2.
Pełny tekst źródła