Kernelized sorting is an approach for matching objects from two sources (or domains) that does not require any prior notion of similarity between objects across the two sources. U...
Jagadeesh Jagarlamudi, Seth Juarez, Hal Daum&eacut...
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Ontology as a discipline of Computer Science has made many claims about its usefulness, however to date there has been very little evaluation of those claims. We present the resul...
Christopher A. Welty, Ruchi Mahindru, Jennifer Chu...
We examine the problem of self-adaptation in game-playing agents as the game requirements evolve incrementally. The goal of our current work is to develop an interactive environme...
Joshua Jones, Chris Parnin, Avik Sinharoy, Spencer...
The continuous advances in genomics, and specifically in the field of transcriptome, require novel computational solutions capable of dealing with great amounts of data. Each expre...