For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
Bogdan Stroe, V. S. Subrahmanian, Sudeshna Dasgupt...
— We propose a feature selection criterion based on kernel discriminant analysis (KDA) for an -class problem, which finds eigenvectors on which the projected class data are loca...
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
In this paper, we consider the problem of ambiguous author names in bibliographic citations, and comparatively study alternative approaches to identify and correct such name varia...
Byung-Won On, Dongwon Lee, Jaewoo Kang, Prasenjit ...