Добірка наукової літератури з теми "Méthodes récursives"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Méthodes récursives".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Méthodes récursives"
Katona, Dániel. "The Pósa method with ATD lenses: Praxeological analysis on math problems in Hungarian talent care education with ‘recursion’ in their logos blocksLa méthode Pósa avec des lentilles TAD: analyse praxéologique des problèmes mathématiques dans l’enseignement hongrois de soins aux talents avec «récursion» dans leurs blocs de logos." Educação Matemática Pesquisa : Revista do Programa de Estudos Pós-Graduados em Educação Matemática 22, no. 4 (September 15, 2020): 259–81. http://dx.doi.org/10.23925/1983-3156.2020v22i4p259-281.
Повний текст джерелаCourrèges, J. P., J. Brett, N. Khutoryansky, and V. Aroda. "Identification des facteurs prédictifs de la réponse au liraglutide dans le diabète de type 2 en utilisant une méthode d’analyse de partition récursive." Annales d'Endocrinologie 74, no. 4 (September 2013): 392. http://dx.doi.org/10.1016/j.ando.2013.07.537.
Повний текст джерелаCourrèges, J. P., R. Ratner, J. Brett, N. Khutoryansky, and V. R. Aroda. "PO3 Identification des facteurs prédictifs de la réponse au liraglutide dans le diabète de type 2 en utilisant une méthode d’analyse de partition récursive." Diabetes & Metabolism 39 (March 2013): A21. http://dx.doi.org/10.1016/s1262-3636(13)71699-9.
Повний текст джерелаMichinel Rondón, Emil Amarilys. "Los imaginarios tecnológicos de los nativos digitales." GACETA DE PEDAGOGÍA, no. 37 (December 1, 2018): 76–102. http://dx.doi.org/10.56219/rgp.vi37.727.
Повний текст джерелаMraoui, Hamid, and Driss Sbibih. "Hermite spline interpolents ― New methods for constructing and compressing Hermite interpolants." Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées Volume 5, Special Issue TAM... (November 18, 2006). http://dx.doi.org/10.46298/arima.1871.
Повний текст джерелаBernardi, Olivier, and Eric Fusy. "A unified bijective method for maps: application to two classes with boundaries." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AN,..., Proceedings (January 1, 2010). http://dx.doi.org/10.46298/dmtcs.2869.
Повний текст джерелаJones, Miles Eli, and Jeffrey Remmel. "A reciprocity approach to computing generating functions for permutations with no pattern matches." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AO,..., Proceedings (January 1, 2011). http://dx.doi.org/10.46298/dmtcs.2933.
Повний текст джерела"COL5-02 Score Diagnostique De Méningite Aiguë Infectieuse : Utilisation Des Méthodes De Partition Récursive (Cart) Et De Monte-Carlo Et Comparaison À 5 Scores." Médecine et Maladies Infectieuses 35 (June 2005): S146. http://dx.doi.org/10.1016/s0399-077x(05)81480-5.
Повний текст джерелаKitaev, Sergey, Jeffrey Liese, Jeffrey Remmel, and Bruce Sagan. "Rationality, irrationality, and Wilf equivalence in generalized factor order." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AK,..., Proceedings (January 1, 2009). http://dx.doi.org/10.46298/dmtcs.2688.
Повний текст джерелаДисертації з теми "Méthodes récursives"
Nespoulous, Eric. "Méthodes de détection et d'exploitation des propriétés de symétries sur les CSP entiers." Dijon, 1999. http://www.theses.fr/1999DIJOS052.
Повний текст джерелаRiondet, Philippe. "Optimisation de la résolution des équations de dispersion : application au calcul des discontinuités." Toulouse, ENSAE, 1997. http://www.theses.fr/1997ESAE0024.
Повний текст джерелаLu, Wei. "Μéthοdes stοchastiques du secοnd οrdre pοur le traitement séquentiel de dοnnées massives". Electronic Thesis or Diss., Normandie, 2024. http://www.theses.fr/2024NORMIR13.
Повний текст джерелаWith the rapid development of technologies and the acquisition of big data, methods capable of processing data sequentially (online) have become indispensable. Among these methods, stochastic gradient algorithms have been established for estimating the minimizer of a function expressed as the expectation of a random function. Although they have become essential, these algorithms encounter difficulties when the problem is ill-conditioned. In this thesis, we focus on second-order stochastic algorithms, such as those of the Newton type, and their applications to various statistical and optimization problems. After establishing theoretical foundations and exposing the motivations that lead us to explore stochastic Newton algorithms, we develop the various contributions of this thesis. The first contribution concerns the study and development of stochastic Newton algorithms for ridge linear regression and ridge logistic regression. These algorithms are based on the Riccati formula (Sherman-Morrison) to recursively estimate the inverse of the Hessian. As the acquisition of big data is generally accompanied by a contamination of the latter, in a second contribution, we focus on the online estimation of the geometric median, which is a robust indicator, i.e., not very sensitive to the presence of atypical data. More specifically, we propose a new stochastic Newton estimator to estimate the geometric median. In the first two contributions, the estimators of the Hessians' inverses are constructed using the Riccati formula, but this is only possible for certain functions. Thus, our third contribution introduces a new Robbins-Monro type method for online estimation of the Hessian's inverse, allowing us then to develop universal stochastic Newton algorithms. Finally, our last contribution focuses on Full Adagrad type algorithms, where the difficulty lies in the fact that there is an adaptive step based on the square root of the inverse of the gradient's covariance. We thus propose a Robbins-Monro type algorithm to estimate this matrix, allowing us to propose a recursive approach for Full AdaGrad and its streaming version, with reduced computational costs. For all the new estimators we propose, we establish their convergence rates as well as their asymptotic efficiency. Moreover, we illustrate the efficiency of these algorithms using numerical simulations and by applying them to real data
Kouchnarenko, Olga. "Sémantique des programmes récursifs-parallèles et méthodes pour leur analyse." Phd thesis, Université Joseph Fourier (Grenoble), 1997. http://tel.archives-ouvertes.fr/tel-00004949.
Повний текст джерелаMercère, Guillaume. "Contribution à l'identification récursive des systèmes par l'approche des sous-espaces." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2004. http://tel.archives-ouvertes.fr/tel-00007958.
Повний текст джерелаAmbellouis, Sébastien. "Analyse du mouvement dans les séquences d'images par une méthode récursive de filtrage spatio-temporel sélectif." Lille 1, 2000. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/2000/50376-2000-77-78.pdf.
Повний текст джерелаPadilla, Arturo. "Identification récursive de systèmes continus à paramètres variables dans le temps." Electronic Thesis or Diss., Université de Lorraine, 2017. http://www.theses.fr/2017LORR0119.
Повний текст джерелаThe work presented in this thesis deals with the identification of dynamic systems represented through continuous-time linear models with slowly time-varying parameters. The complexity of the identification problem comes on the one hand from the unknown character of the parameter variations and on the other hand from the presence of noises of unknown nature on the measured signals. The proposed solutions rely on a judicious combination of the Kalman filter assuming that the variations of the parameters can be represented in the form of a random walk, and the method of the instrumental variable which has the advantage of being robust with respect to the nature of the measurement noises. The recursive algorithms are developed in an open-loop and closed-loop identification setting. The different variants are distinguished by the way in which the instrumental variable is built. Inspired by the solution developed for time-invariant linear systems, an adaptive construction of the instrumental variable is suggested in order to be able to follow the evolution of the parameters as well as possible. The performance of the developed methods are evaluated using Monte Carlo simulations and show the supremacy of the proposed solutions based on the instrumental variable compared with the more classical least squares based approaches. The practical aspects and implementation issues are of paramount importance to obtain a good performance when these estimators are used. These aspects are studied in detail and several solutions are proposed not only to robustify the estimators with respect to the choice of hyperparameters but also with respect to their numerical implementation. The algorithms developed have enhanced the functions of the CONTSID toolbox for Matlab. Finally, the developed estimators are considered in order to track parameters of two physical systems: a benchmark available in the literature consisting of a bandpass electronic filter and a throttle valve equipping the car engines. Both applications show the potential of the proposed approaches to track physical parameters that vary slowly over time
Padilla, Arturo. "Identification récursive de systèmes continus à paramètres variables dans le temps." Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0119/document.
Повний текст джерелаThe work presented in this thesis deals with the identification of dynamic systems represented through continuous-time linear models with slowly time-varying parameters. The complexity of the identification problem comes on the one hand from the unknown character of the parameter variations and on the other hand from the presence of noises of unknown nature on the measured signals. The proposed solutions rely on a judicious combination of the Kalman filter assuming that the variations of the parameters can be represented in the form of a random walk, and the method of the instrumental variable which has the advantage of being robust with respect to the nature of the measurement noises. The recursive algorithms are developed in an open-loop and closed-loop identification setting. The different variants are distinguished by the way in which the instrumental variable is built. Inspired by the solution developed for time-invariant linear systems, an adaptive construction of the instrumental variable is suggested in order to be able to follow the evolution of the parameters as well as possible. The performance of the developed methods are evaluated using Monte Carlo simulations and show the supremacy of the proposed solutions based on the instrumental variable compared with the more classical least squares based approaches. The practical aspects and implementation issues are of paramount importance to obtain a good performance when these estimators are used. These aspects are studied in detail and several solutions are proposed not only to robustify the estimators with respect to the choice of hyperparameters but also with respect to their numerical implementation. The algorithms developed have enhanced the functions of the CONTSID toolbox for Matlab. Finally, the developed estimators are considered in order to track parameters of two physical systems: a benchmark available in the literature consisting of a bandpass electronic filter and a throttle valve equipping the car engines. Both applications show the potential of the proposed approaches to track physical parameters that vary slowly over time
Heitz, Thomas. "Une méthode pour le prétraitement des textes : dépendances entre traitements et leur intelligibilité." Paris 11, 2008. http://www.theses.fr/2008PA112074.
Повний текст джерелаThis work deals with knowledge discovery in texts whose main applications are information retrieval using a search engine, communication filtering using an e-mail client and knowledge management using methods of knowledge engineering. We justify, define, illustrate and evaluate two new complementary extensions for text mining chains intended to save time and improve quality. These extensions apply to all the chain links and take into account the global chain and no more only one link in particular since the field is now sufficiently mature. On the one hand, one can improve the text mining chain while modeling locally and globally the information exchanges which take place. The objective is to optimize the dependencies between the various treatments in order to transmit the results between treatments among which those intractable but not those irretrievable. To reach it, we introduce recursive and mutually recursive dependent treatments. On the other hand, one can improve the text mining chain while taking into account that the majority of data are raw, without initial annotations. The objective is thus to make more controllable the training algorithms at the time of the training. To reach it, we introduce the user guided learning which consists in combining the stages of annotation and training by making coevolve the annotations, the learned model and knowledge from the user
Khereddine, Rafik. "Méthode adaptative de contrôle logique et de test de circuits AMS/FR." Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00647169.
Повний текст джерелаЧастини книг з теми "Méthodes récursives"
Marceau, Étienne. "Méthodes récursives d’agrégation." In Modélisation et évaluation quantitative des risques en actuariat, 201–48. Paris: Springer Paris, 2013. http://dx.doi.org/10.1007/978-2-8178-0112-4_6.
Повний текст джерелаANDRÉ, Jean-Michel, and Philippe JONNARD. "Propagation du rayonnement X dans une structure de Bragg : domaine fréquentiel." In Rayonnement X et structures de Bragg artificielles, 27–67. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9187.ch2.
Повний текст джерела