📊 Գործառնությունների հետազոտություն

Travelling Salesman — TSPThree algorithms compete on the same city set: Nearest Neighbour greedy, 2-opt local search,… 0/1 KnapsackNewMaximize value without exceeding capacity. Watch dynamic programming fill the dp table cell… Queueing TheoryNewAn M/M/c queue with Poisson arrivals and exponential service. Watch the line form and… Simulated Annealing — Escaping Local MinimaNewSolve a travelling-salesman tour with simulated annealing: accept worse moves with… Particle Swarm Optimization — Swarm IntelligenceNewA swarm of particles searches a 2D cost landscape, each pulled toward its personal best and… CPU Scheduling — FCFS, SJF, Round RobinNewSchedule processes on a CPU with FCFS, SJF, priority and round-robin policies. An animated…