ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
— In this paper, we propose a new approach for computing force-closure grasps of two-dimensional and threedimensional objects. Assuming n hard-finger contact with Coulomb fricti...
Belkacem Bounab, Daniel Sidobre, Abdelouhab Zaatri
In the high performance computing domain, the speed of execution of a program has typically been the primary performance metric. But productivity is also of concern to high perfor...
Marvin V. Zelkowitz, Victor R. Basili, Sima Asgari...
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Abstract. Erasure of information incurs an increase in entropy and dissipates heat. Therefore, information-preserving computation is essential for constructing computers that use e...