Structure-driven optimization methods for modular technical systems
-
Updated
Mar 7, 2015 - Python
Structure-driven optimization methods for modular technical systems
Implemention of Gaussian Elimination with Scaled Partial Pivoting to solve system of equations using matrices.
Tournament bracket view for iOS. Developed in swift.
Implement Inference AlgorithmsusingBayesian Networks
Bracket Program 5000 - A tournament bracket software supporting arbitrary elimination.
Repository for implementing a gauss elimination algorithm for MIPS in a computer systems engineering course at Chalmers, 2018.
Chapter 20 in forthcoming Rabies, 4th edition
Automated Backward and Forward Selection On Python
Elimination-backoff stack is an unbounded lock-free LIFO linked list, that eliminates concurrent pairs of pushes and pops with exchanges.
ResPol is a software to compute projections of Newton polytopes of important polynomials in algebraic geometry such as the resultant defined for a given polynomial system.
A simple sudoku solver in Python3
A Concurrent data structure is a particular way of storing and organizing data for access by multiple computing threads (or processes) on a computer.
Codes and explanations for some numerical methods to find solutions to linear algebraic equations.
A package to create and manage tournaments with Go
Code analysis for "Impact of intensified control strategies on incidence of visceral leishmaniasis in a highly endemic district of Bihar, India: an interrupted time series analysis" Kumar, Siddiqui, Pollington et al.
World's first n-tuple elimination (triple elimination and up) tournament generator
Genetic algorithms and Evolutionary computing - Project on the Travelling Salesman Problem (KU Leuven course H02D1A)
Add a description, image, and links to the elimination topic page so that developers can more easily learn about it.
To associate your repository with the elimination topic, visit your repo's landing page and select "manage topics."