48 search results - page 6 / 10 » Inconsistent Heuristics |
119
click to vote
ICCV
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
121
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
102
click to vote
AAAI
2007
15 years 4 months ago
2007
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
CONSTRAINTS
2007
15 years 2 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
108
Voted
AIMSA
2004
Springer
15 years 7 months ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...