We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
In this paper, we propose two approaches for combining geometric information with ICA algorithm to solve permutation problem under the scenario where a rough information about the...
In this paper, we consider sparse decomposition (SD) of twodimensional (2D) signals on overcomplete dictionaries with separable atoms. Although, this problem can be solved by conv...
Aboozar Ghafari, Massoud Babaie-Zadeh, Christian J...
— This paper presents a decentralized planning method for generating dynamic whole body motions of multilink robots including humanoids. First, a robotic system will be modeled a...
Yuichi Tazaki, Hisashi Sugiura, Herbert Janssen, C...