Contents
Academic literature on the topic 'Algorithme en ligne avec conseil'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorithme en ligne avec conseil.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Algorithme en ligne avec conseil"
ADELINE-DUFLOT, F., E. FERRAT, S. BROSSIER, R. GAUZIT, R. COHEN, and V. RENARD. "Conseil téléphonique en prescription antibiotique (CoTéPrAgmatique) auprès des médecins généralistes : résultats de deux ans de fonctionnement." EXERCER 32, no. 176 (October 1, 2021): 352–58. http://dx.doi.org/10.56746/exercer.2021.176.352.
Full textClarke, Graham. "Décisions rendues par le Conseil canadien des relations du travail." Relations industrielles 44, no. 4 (April 12, 2005): 933–46. http://dx.doi.org/10.7202/050543ar.
Full textOh, Jiwon, Marie-Sarah Gagné-Brosseau, Melanie Guenette, Catherine Larochelle, François Lemieux, Suresh Menon, Sarah A. Morrow, et al. "Toward a Shared-Care Model of Relapsing-Remitting Multiple Sclerosis: Role of the Primary Care Practitioner." Canadian Journal of Neurological Sciences / Journal Canadien des Sciences Neurologiques 45, no. 3 (May 2018): 304–12. http://dx.doi.org/10.1017/cjn.2018.7.
Full textDouzon-Bernal, M. "Un dispositif global de soins des troubles de la relation mère–nourrisson." European Psychiatry 28, S2 (November 2013): 57. http://dx.doi.org/10.1016/j.eurpsy.2013.09.149.
Full textSolère, Jean-Luc. "Bayle historien et critique du matérialisme dans le dictionnaire." Kriterion: Revista de Filosofia 50, no. 120 (December 2009): 423–36. http://dx.doi.org/10.1590/s0100-512x2009000200010.
Full textPéguret, Muriel, and Catherine Lamaison. "L’influence du Cadre européen commun de référence pour les langues (2001) sur l’enseignement du français langue seconde au niveau universitaire au Canada." La Revue de l’AQEFLS 33, no. 1 (September 16, 2021): 35–44. http://dx.doi.org/10.7202/1081268ar.
Full textChauvard, Jean-François. "Adaptabilité versus inaliénabilité Les dérogations des fidéicommis dans la Venise du XVIIIe siècle." Annales. Histoire, Sciences Sociales 70, no. 04 (December 2015): 849–78. http://dx.doi.org/10.1353/ahs.2015.0199.
Full textNaji, Khadija, and Abdelali Ibriz. "Approach for Eliciting Learners' Preferences in Moocs Through Collaborative Filtering." International Journal of Emerging Technologies in Learning (iJET) 17, no. 14 (July 26, 2022): 235–45. http://dx.doi.org/10.3991/ijet.v17i14.29887.
Full textALLEREAU, P., E. ALLORY, and A. MAURY. "Les avis en ligne concernant les MG. Une étude par analyse de contenu en Ille-et-Vilaine." EXERCER 35, no. 200 (February 1, 2024): 64–69. http://dx.doi.org/10.56746/exercer.2024.200.64.
Full textVeall, Michael R. "Internationalization and the Internet: The Case of Canadian Public Policy/Analyse de politiques." Scholarly and Research Communication 11, no. 1 (March 10, 2020): 9. http://dx.doi.org/10.22230/src.2020v11n1a351.
Full textDissertations / Theses on the topic "Algorithme en ligne avec conseil"
Jin, Shendan. "Online computation beyond standard models." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS152.
Full textIn the standard setting of online computation, the input is not entirely available from the beginning, but is revealed incrementally, piece by piece, as a sequence of requests. Whenever a request arrives, the online algorithm has to make immediately irrevocable decisions to serve the request, without knowledge on the future requests. Usually, the standard framework to evaluate the performance of online algorithms is competitive analysis, which compares the worst-case performance of an online algorithm to an offline optimal solution. In this thesis, we will study some new ways of looking at online problems. First, we study the online computation in the recourse model, in which the irrevocability on online decisions is relaxed. In other words, the online algorithm is allowed to go back and change previously made decisions. More precisely, we show how to identify the trade-off between the number of re-optimization and the performance of online algorithms for the online maximum matching problem. Moreover, we study measures other than competitive analysis for evaluating the performance of online algorithms. We observe that sometimes, competitive analysis cannot distinguish the performance of different algorithms due to the worst-case nature of the competitive ratio. We demonstrate that a similar situation arises in the linear search problem. More precisely, we revisit the linear search problem and introduce a measure, which can be applied as a refinement of the competitive ratio. Last, we study the online computation in the advice model, in which the algorithm receives as input not only a sequence of requests, but also some advice on the request sequence. Specifically, we study a recent model with untrusted advice, in which the advice can be either trusted or untrusted. Assume that in the latter case, the advice can be generated from a malicious source. We show how to identify a Pareto optimal strategy for the online bidding problem in the untrusted advice model