Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Personal robots are designed to provide entertainment, companion and communication interfaces. They can play an important role as natural, flexible and non-invasive interfaces to ...
Personalization of a self-services kiosk or ATM may provide the user with an efficient means of obtaining new appropriate services with the degree of immediate gratification consu...
Jamie Sands, Graham Johnson, David Benyon, Gr&eacu...
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...