We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Abstract: An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling ...

Network slowdowns could soon be a thing of the past, thanks to a superfast new algorithm. The breakthrough offers a dramatically faster solution to a problem that has been plaguing computer scientists ...

Fast-DiM Uses second-order multistep ODE solver to solve the PF ODE to reduce NFE Fast-DiM-ode Same as Fast-DiM plus an improved formulation to solve the PF ODE forwards in time, resulting in reduced ...

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were ...