In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
The performance of existing adders varies widely in their speed and area requirements, which in turn sometimes makes designers pay a high cost in area especially when the delay req...
Intelligent Tutoring Systems (ITSs) have proved useful in a variety of domains, but are notoriously resource intensive to build. We have created two programs (“tutor generators...
Viswanathan Kodaganallur, Rob R. Weitz, David Rose...