~/talk

Amazing Algorithms for Solving Problems in Software

Talkat NDC Oslo 2022 · 2022-09-26..09-30· [machine-learning]
links:none on file
slides:none on file

Simulations show a 20-node best-path problem solved with bee and ant colony heuristics, a 40-firefly swarm optimizing the Mikhailovich test surface, and an amoeba optimizer (size 13, max epochs ~70) used to train a simple ML model with 16 inputs on ~430 records, reaching 95.7% accuracy. Code is plain C# run in Visual Studio and available on GitHub; live demos sit at amazingalgorithms.azurewebsites.net. Expect nondeterministic results, tunable parameters, and no optimality guarantees from these bio-inspired methods.

AI-written summary · about

  1. 0:00Introduction
  2. 0:40Favorite physicists and mathematicians
  3. 1:17Open source projects
  4. 1:33Liquid Victor
  5. 1:47GiveCamp
  6. 3:43Agenda
  7. 4:17Best Path
  8. 6:15Bee Colony
  9. 10:06Bee Colony Optimization
  10. 16:51Reducing Costs
  11. 17:11Mikhailovich Function
  12. 17:42Firefly Optimization
  13. 20:26Difficulties
  14. 22:49Amoeba
  15. 24:06Flowchart
  16. 26:37Amoebas
  17. 27:35Linear regression
  18. 30:04Error function
  19. 31:02Prediction model
  20. 33:29Sigmoid function
  21. 34:13C Code
  22. 39:39Training the Model
  23. 41:40Predict Method
  24. 43:11Results
  25. 45:14Bioinspired algorithms
  26. 46:48Best path algorithms
  27. 48:22Resources
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.