Backtracking

Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction or enumeration problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.

Example is Maze Solving (เขาวงกต): Moving through a maze and turning back when you hit a wall to try the other fork in the road.

Backtracking is implemented by means of recursion.

Poisson distribution (& binomial distribution & guassian distribution)

Poisson distribution expresses the probability of a given number of events of the same type (e.g., counting the number of emails received between 9:00 AM and 10:00 AM. (one event type: emails)) occurring in a fixed interval of time if these events occur with a known constant mean rate and independently of the time since the last event.

Poisson distribution vs Binomial distribution

Guassian distribution is aka Normal distribution often used to examine students' scores

--Gemini & Wikipedia

Optimization algorithms for Deep learning

 https://neptune.ai/blog/deep-learning-optimization-algorithms

Literature review

 ที่ม สุรนารี ใช้คำภาษาไทยว่า ปริทัศน์วรรณกรรม

Algorithms for Competitive Programming

 https://cp-algorithms.com/index.html

AI for creating VR world

https://labs.google/projectgenie

https://www.youtube.com/watch?v=YxkGdX4WIBE

UML creation scripting (similar to LaTex)

• https://plantuml.com/
• plantuml in VS' marketplace : https://marketplace.visualstudio.com/items?itemName=jebbs.plantuml
• try the following code in this editor https://editor.plantuml.com

@startuml

Alice -> Bob : hello

@enduml

Multilingual AI detector (not free)

https://app.originality.ai/home/scan 

It supports Thai language.

Call number codes

 

Superlinear, Linear, Sublinear

Superlinear คือ slop เพิ่มขึ้นเรื่อยๆ (โตเร็วกว่า linear)

Sublinear คือ slope ลดลงเรือยๆ (โตช้ากว่า linear)

Example:

Settrade streaming pro