Like others in the field, technology service providers in the Indiana University (IU) School of Education face many demands despite limited resources. In Education Technology Serv...
In this paper we propose a bracket algebra based elimination method for automated generation of readable proofs for theorems in incidence geometry. This method is based on two tech...
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Abstract. The technique of hyper-programming allows program representations held in a persistent store to contain embedded links to persistent code and data. In 1994, Connor et al ...
Evangelos Zirintsis, Graham N. C. Kirby, Ronald Mo...