We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Feature extraction and classification are two important components in pattern recognition. In this paper, we propose dynamic target classification in WSNs. The main idea of this a...
Designing technical plants is a complex and demanding process. It has been shown that the optimization of the simple facility placement problem is already NP-hard. Optimization of...