One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
The paper presents a fail-safe mobility management and a collision prevention platform for a group of asynchronous cooperative mobile robots. The fail-safe platform consists of a ...
: Coalition formation in social networks consisting of a graph of interdependent agents allows many choices of which task to select and with whom to partner in the social network. ...
: A solution to the singularity problem is presented from the approach of the operational space formulation which involves both motion and force control. A brief summary of the Ope...