Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
Wenliang Zhong, Weike Pan, James T. Kwok, Ivor W. ...
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
A general wireless networking problem is formulated whereby end-to-end user rates, routes, link capacities, transmitpower, frequency and power resources are jointly optimized acros...
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...