In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
- The two dominant forms of SLAM are based on Extended Kalman Filtering and Consistent Pose Estimation. We show that these are particular subsets of a more general view of the SLAM...