Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
: For a large class of bounded-error estimation problems, the posterior feasible set 5 for the parameters can be dened by nonlinear inequalities. The set-inversion approach combine...
— We present adaptive admittance control of a robotic manipulator, with uncertain dynamic parameters, operating in a constrained task space. To provide compliance to external for...