Добірка наукової літератури з теми "Efficacité des algorithmes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Efficacité des algorithmes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Efficacité des algorithmes"
Distinguin, L., M. Blanchard, I. Rouillon, M. Parodi, and N. Loundon. "Réimplantation cochléaire chez l’enfant : efficacité des algorithmes décisionnels." Annales françaises d'Oto-rhino-laryngologie et de Pathologie Cervico-faciale 135, no. 4 (September 2018): 235–39. http://dx.doi.org/10.1016/j.aforl.2017.11.006.
Повний текст джерелаBerriche, Amira, Dominique Crié, and Michel Calciu. "Une Approche Computationnelle Ancrée : Étude de cas des tweets du challenge #Movember en prévention de santé masculine." Décisions Marketing N° 112, no. 4 (January 25, 2024): 79–103. http://dx.doi.org/10.3917/dm.112.0079.
Повний текст джерелаGeoffroy, P. A. "Les objets connectés sont-ils le futur de la sémiologie psychiatrique ?" European Psychiatry 30, S2 (November 2015): S78. http://dx.doi.org/10.1016/j.eurpsy.2015.09.353.
Повний текст джерелаBibault, J. E., X. Mirabel, T. Lacornerie, C. Dewas, A. Jouin, E. Bogart, E. Tresch, and É. Lartigau. "Radiothérapie stéréotaxique des carcinomes bronchiques de petit stade chez 205 patients : efficacité, toxicité et comparaison dosimétrique de deux algorithmes de calcul de la dose." Cancer/Radiothérapie 18, no. 5-6 (October 2014): 621. http://dx.doi.org/10.1016/j.canrad.2014.07.100.
Повний текст джерелаYu, Bole. "Comparative Analysis of Machine Learning Algorithms for Sentiment Classification in Amazon Reviews." Highlights in Business, Economics and Management 24 (January 22, 2024): 1389–400. http://dx.doi.org/10.54097/eqmavw44.
Повний текст джерелаMohammed, Zouiten, Chaaouan Hanae, and Setti Larbi. "Comparative study on machine learning algorithms for early fire forest detection system using geodata." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 5 (October 1, 2020): 5507. http://dx.doi.org/10.11591/ijece.v10i5.pp5507-5513.
Повний текст джерелаSel, Artun, Bilgehan Sel, Umit Coskun, and Cosku Kasnakoglu. "Comparative Study of an EKF-Based Parameter Estimation and a Nonlinear Optimization-Based Estimation on PMSM System Identification." Energies 14, no. 19 (September 25, 2021): 6108. http://dx.doi.org/10.3390/en14196108.
Повний текст джерелаShenify, Mohamed, Fokrul Alom Mazarbhuiya, and A. S. Wungreiphi. "Detecting IoT Anomalies Using Fuzzy Subspace Clustering Algorithms." Applied Sciences 14, no. 3 (February 2, 2024): 1264. http://dx.doi.org/10.3390/app14031264.
Повний текст джерелаMortazavi, Amin, Amir Rashidi, Mostafa Ghaderi-Zefrehei, Parham Moradi, Mohammad Razmkabir, Ikhide G. Imumorin, Sunday O. Peters, and Jacqueline Smith. "Constraint-Based, Score-Based and Hybrid Algorithms to Construct Bayesian Gene Networks in the Bovine Transcriptome." Animals 12, no. 10 (May 19, 2022): 1305. http://dx.doi.org/10.3390/ani12101305.
Повний текст джерелаAbdul Latiff, Liza, Huda Adibah Mohd Ramli, Ani Liza Asnawi, and Nur Haliza Abdul Wahab. "A STUDY ON CHANNEL AND DELAY-BASED SCHEDULING ALGORITHMS FOR LIVE VIDEO STREAMING IN THE FIFTH GENERATION LONG TERM EVOLUTION-ADVANCED." IIUM Engineering Journal 23, no. 1 (January 4, 2022): 233–43. http://dx.doi.org/10.31436/iiumej.v23i1.2115.
Повний текст джерелаДисертації з теми "Efficacité des algorithmes"
Zhang, Jian Ping. "Contrôle de flux pour le service ABR des réseaux ATM : équité et efficacité." Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0010.
Повний текст джерелаPetit, Franck. "Efficacité et simplicité dans les algorithmes distribués auto-stabilisants de parcours en profondeur de jeton." Amiens, 1998. http://www.theses.fr/1998AMIE0103.
Повний текст джерелаHamdaoui, Mohamed. "Optimisation multicritère de l’efficacité propulsive de mini-drônes à ailes battantes par algorithmes évolutionnaires." Paris 6, 2009. http://www.theses.fr/2009PA066448.
Повний текст джерелаDoncel, Josu. "Efficiency of distributed queueing games and of path discovery algorithms." Thesis, Toulouse, INSA, 2015. http://www.theses.fr/2015ISAT0007/document.
Повний текст джерелаThis thesis deals with the efficiency of distributed resource sharing algorithms and of online path discovery algorithms. In the first part of the thesis, we analyse a game in which users pay for using a shared resource. The allocated resource to a user is directly proportional to its payment. Each user wants to minimize its payment while ensuring a certain quality of service. This problem is modelled as a non-cooperative resource-sharing game. Due to lack of analytical expressions for the underlying queuing discipline, we are able to give the solution of the game only under some assumptions. For the general case, we develop an approximation based on a heavy-traffic result and we validate the accuracy of the approximation numerically. In the second part, we study the efficiency of load balancing games, i.e., we compare the loss in performance of noncooperative decentralized routing with a centralized routing. We show that the PoA is very pessimistic measure since it is achieved in only pathological cases. In most scenarios, distributed implementations of load-balancing perform nearly as well as the optimal centralized implementation. In the last part of the thesis, we analyse the optimal path discovery problem in complete graphs. In this problem, the values of the edges are unknown but can be queried. For a given function that is applied to paths, the goal is to find a best value path from a source to a given destination querying the least number of edges. We propose the query ratio as efficiency measure of algorithms that solve this problem. We prove a lower-bound for any algorithm that solves this problem and we proposed an algorithm with query ratio strictly less than 2
Belmega, Elena Veronica. "Problèmes d'allocations de ressouces dans les réseaux MIMO sans fil distribués." Paris 11, 2010. http://www.theses.fr/2010PA112259.
Повний текст джерелаLn this thesis manuscript, the main objective is to study the wireless networks where the node terminals are equipped with multiple antennas. Rising topics such as self-optimizing networks, green communications and distributed algorithms have been approached mainly from a theoretical perspective. To this aim, we have used a diversified spectrum of tools from Game Theory, Information Theory, Random Matrix Theory and Learning Theory in Games. We start our analysis with the study of the power allocation problem in distributed networks. The transmitters are assumed to be autonomous and capable of allocating their powers to optimize their Shannon achievable rates. A non-cooperative game theoretical framework is used to investigate the solution to this problem. Distributed algorithms which converge towards the optimal solution, i. E. The Nash equilibrium, have been proposed. Two different approaches have been applied: iterative algorithms based on the best-response correspondence and reinforcement learning algorithms. Another major issue is related to the energy-efficiency aspect of the communication. Ln order to achieve high transmission rates, the power consumption is also high. Ln networks where the power consumption is the bottleneck, the Shannon achievable rate is no longer suitable performance metric. This is why we have also addressed the problem of optimizing an energy-efficiency function
Tan, Pauline. "Précision de modèle et efficacité algorithmique : exemples du traitement de l'occultation en stéréovision binoculaire et de l'accélération de deux algorithmes en optimisation convexe." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX092/document.
Повний текст джерелаThis thesis is splitted into two relatively independant parts. The first part is devoted to the binocular stereovision problem, specifically to the occlusion handling. An analysis of this phenomena leads to a regularity model which includes a convex visibility constraint. The resulting energy functional is minimized by convex relaxation. The occluded areas are then detected thanks to the horizontal slope of the disparity map and densified. Another method with occlusion handling was proposed by Kolmogorov and Zabih. Because of its efficiency, we adapted it to two auxiliary problems encountered in stereovision, namely the densification of sparse disparity maps and the subpixel refinement of pixel-accurate maps.The second part of this thesis studies two convex optimization algorithms, for which an acceleration is proposed. The first one is the Alternating Direction Method of Multipliers (ADMM). A slight relaxation in the parameter choice is shown to enhance the convergence rate. The second one is an alternating proximal descent algorithm, which allows a parallel approximate resolution of the Rudin-Osher-Fatemi (ROF) pure denoising model, in color-image case. A FISTA-like acceleration is also proposed
Machart, Pierre. "Coping with the Computational and Statistical Bipolar Nature of Machine Learning." Phd thesis, Aix-Marseille Université, 2012. http://tel.archives-ouvertes.fr/tel-00771718.
Повний текст джерелаDjeddour, Khédidja. "Estimation récursive du mode et de la valeur modale d'une densité : test d'ajustement de loi." Versailles-St Quentin en Yvelines, 2003. http://www.theses.fr/2003VERS0016.
Повний текст джерелаBeltaief, Slim. "Algorithmes optimaux de traitement de données pour des systèmes complexes d'information et télécommunication dans un environnement incertain." Thesis, Normandie, 2017. http://www.theses.fr/2017NORMR056/document.
Повний текст джерелаThis thesis is devoted to the problem of non parametric estimation for continuous-time regression models. We consider the problem of estimating an unknown periodoc function S. This estimation is based on observations generated by a stochastic process; these observations may be in continuous or discrete time. To this end, we construct a series of estimators by projection and thus we approximate the unknown function S by a finite Fourier series. In this thesis we consider the estimation problem in the adaptive setting, i.e. in situation when the regularity of the fonction S is unknown. In this way, we develop a new adaptive method based on the model selection procedure proposed by Konev and Pergamenshchikov (2012). Firstly, this procedure give us a family of estimators, then we choose the best possible one by minimizing a cost function. We give also an oracle inequality for the risk of our estimators and we give the minimax convergence rate
Luo, Jia. "Algorithmes génétiques parallèles pour résoudre des problèmes d'ordonnancement de tâches dynamiques de manière efficace en prenant en compte l'énergie." Thesis, Toulouse 3, 2019. http://www.theses.fr/2019TOU30001.
Повний текст джерелаDue to new government legislation, customers' environmental concerns and continuously rising cost of energy, energy efficiency is becoming an essential parameter of industrial manufacturing processes in recent years. Most efforts considering energy issues in scheduling problems have focused on static scheduling. But in fact, scheduling problems are dynamic in the real world with uncertain new arrival jobs after the execution time. In this thesis, two energy efficient dynamic scheduling problems are studied. Model I analyzes the total tardiness and the makespan with a peak power limitation while considering the flexible flow shop with new arrival jobs. A periodic complete rescheduling approach is adopted to represent the optimization problem. Model II concerns an investigation into minimizing total tardiness and total energy consumption in the job shop with new urgent arrival jobs. An event driven schedule repair approach is utilized to deal with the updated schedule. As an adequate renewed scheduling plan needs to be obtained in a short response time in dynamic environment, two parallel Genetic Algorithms (GAs) are proposed to solve these two models respectively. The parallel GA I is a CUDA-based hybrid model consisting of an island GA at the upper level and a fine-grained GA at the lower level. It combines metrics of two hierarchical layers and takes full advantage of CUDA's compute capability. The parallel GA II is a dual heterogeneous design composed of a cellular GA and a pseudo GA. The islands with these two different structures increase the population diversity and can be well parallelized on GPUs simultaneously with multi-core CPU. Finally, numerical experiments are conducted and show that our approaches can not only solve the problems flexibly, but also gain competitive results and reduce time requirements
Частини книг з теми "Efficacité des algorithmes"
BELMONTE, Romain, Pierre TIRILLY, Ioan Marius BILASCO, Nacim IHADDADENE, and Chaabane DJERABA. "Efficacité de la détection des points de repères faciaux." In Analyse faciale en conditions non contrôlées, 75–103. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9111.ch2.
Повний текст джерелаDutta, Palash. "Human Health Risk Assessment via Amalgamation of Probability and Fuzzy Numbers." In Emerging Trends and Applications in Cognitive Computing, 99–123. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-5793-7.ch005.
Повний текст джерелаKumari, Rashmi, Subhranil Das, Raghwendra Kishore Singh, Anvi Kohli, Arya Sunil, and Arushi Dadhich. "Getting Started With Computational Drug Discovery." In Converging Pharmacy Science and Engineering in Computational Drug Discovery, 235–58. IGI Global, 2024. http://dx.doi.org/10.4018/979-8-3693-2897-2.ch012.
Повний текст джерелаShahid, Imran, and Qaiser Jabeen. "Treatment Recommendations for Harder-to-Cure and Vulnerable Populations." In Hepatitis C Virus-Host Interactions and Therapeutics: Current Insights and Future Perspectives, 203–30. BENTHAM SCIENCE PUBLISHERS, 2023. http://dx.doi.org/10.2174/9789815123432123010011.
Повний текст джерелаТези доповідей конференцій з теми "Efficacité des algorithmes"
Williams, Glen, Lucas Puentes, Jacob Nelson, Jessica Menold, Conrad Tucker, and Christopher McComb. "Comparing Attribute- and Form-Based Machine Learning Techniques for Component Prediction." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22256.
Повний текст джерела