Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departm...
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...