This program presents an algorithm designed to provide a more straightforward and easy-to-understand implementation of USCF Swiss-style pairing for chess tournaments. The core of this algorithm ...

Model abstraction for finite state automata is helpful for decreasing computational complexity and improving comprehensibility for the verification and control synthesis of discrete-event systems (DES ...

This project is similar to Assignment #HW5 in CS-1004, Introduction to Programming for Non-majors, in A-term 2016 as described here in documents available on Canvas. In that assignment, students wrote ...

Abstract: The problem of location of protective devices is important in distribution networks so the various methods were considered for installation of fuse, recloser, disconnecting switch and ...

Abstract: This paper proposes a method to solve the fault section estimation (FSE) problem in power systems by developing a nonlinear binary programming model using the AMPL mathematical programming ...

This paper presents a computationally efficient method for binary classification using Manski's (1975,1985) maximum score model when covariates are discretely distributed and parameters are partially ...

I found this quite interesting. Basically, given the following description: Binary search solves the problem [of searching within a pre-sorted array] by keeping track of a range within the array in ...