Most of the models are completed in a single file and implemented in a simple way. The machine learning part of the code does not use any external libraries, except for the loading part of the ONNX ...

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

Complex genetic diseases may be modulated by a large number of epistatic interactions affecting a polygenic phenotype. Identifying these interactions is difficult due to computational complexity, ...

Pattern matching is one of the core algorithms in computer science that stand to benefit from quantum computers 1,2. Pattern matching algorithms are used ubiquitously used in image processing 3,4, the ...