Sciweavers

14386 search results - page 402 / 2878
» The Chinese Generals Problem
Sort
View
ECAI
1990
Springer
15 years 11 months ago
Knowledge-Intensive Case-Based Reasoning and Sustained Learning
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...
Agnar Aamodt
ECML
1991
Springer
15 years 10 months ago
Learning by Analogical Replay in PRODIGY: First Results
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
Manuela M. Veloso, Jaime G. Carbonell
FOCS
1997
IEEE
15 years 11 months ago
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
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...
Pascal Koiran
ARSCOM
2007
115views more  ARSCOM 2007»
15 years 7 months ago
Minimal Universal Bipartite Graphs
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...
Vadim V. Lozin, Gábor Rudolf
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
16 years 14 days ago
SLAM via Variable Reduction from Constraint Maps
- 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...
Kurt Konolige