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 ...

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 ...

# BSTs is having a faster overall search time than other implementations. # The reason for their fast search time is that the nodes with high # frequencies will be placed near the root of the tree ...

We investigate in this paper the Lagrangian duality properties of linear equality constrained binary quadratic programming. We derive an underestimation of the duality gap between the primal problem ...

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 ...

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 ...