— We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained m...
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
This paper addresses the problem of engineering energy-efficient target detection applications using unattended Wireless Sensor Networks (WSNs) for long-lasting surveillance of are...
Paolo Medagliani, Jeremie Leguay, Vincent Gay, Mar...
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...