Date : 2025-11-28 Auteur : [[Brian Christian]] *** # Argument principal Transférer des algorithmes à des problématiques de la vie quotidienne nous permet d'atteindre le résultat optimal pour une charge mentale minimale. # Concepts principaux ## De l'utilité des algorithmes dans la vie quotidienne ![[De l'utilité des algorithmes dans la vie quotidienne]] ## Règle des 37 % ![[4 GARDEN/Règle des 37 %]] ## Win-Stay, Lose-Shift ![[Win-Stay, Lose-Shift]] ## Gittins Index ![[Gittins Index]] ## Upper Confidence Bound ![[Upper Confidence Bound]] ## Exploration vs Exploitation ![[Exploration vs Exploitation]] ## Merge Sort ![[Merge Sort]] ## Bubble Sort ![[Bubble Sort]] ## Insertion Sort ![[Insertion Sort]] ## Round Robin ![[Round Robin]] ## Ladder ![[Ladder]] ## Comparison Counting Sort ![[Comparison Counting Sort]] ## Random Eviction ![[Random Eviction]] ## First In First Out ![[First In First Out]] ## Last Recently Used ![[Last Recently Used]] ## Earliest Due Date ![[Earliest Due Date]] ## Moore's Algorithm ![[Moore's Algorithm]] ## Shortest Processing Time ![[Shortest Processing Time]] ## Weighted Shortest Processing Time ![[Weighted Shortest Processing Time]] ## Loi de Laplace ![[Loi de Laplace]] ## Loi de Bayes ![[Loi de Bayes]] ## Principe de Copernic ![[Principe de Copernic]] ## Multiplicative Rule ![[Multiplicative Rule]] ## Average Rule ![[Average Rule]] ## Additive Rule ![[Additive Rule]] ## Cross-Validation ![[Cross-Validation]] ## Regularization ![[Regularization]] ## Lagrangian Relaxation ![[Lagrangian Relaxation]] ## Monte Carlo Method ![[Monte Carlo Method]] ## Hill Climbing ![[Hill Climbing]] ## Metropolis Algorithm ![[Metropolis Algorithm]] ## Simulated Annealing ![[Simulated Annealing]] ## Exponential Backoff ![[Exponential Backoff]] ## Additive Increase, Multiplicative Decrease ![[Additive Increase, Multiplicative Decrease]]