In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Abstract--For a multiple-input multiple-output (MIMO) system with more antennas at the receiver than the transmitter, selecting the same number of receiver antennas as the number o...
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...