Displaying similar documents to “Combining Odometry and Visual Loop-Closure Detection for Consistent Topo-Metrical Mapping”

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [ (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [ (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size...

About the choice of the variable to unassign in a decision repair algorithm

Cédric Pralet, Gérard Verfaillie (2010)

RAIRO - Operations Research

Similarity:

The algorithm (Jussien and Lhomme, (2002) 21–45), which has been designed to solve (CSP), can be seen, either (i) as an extension of the classical algorithm with the introduction of a free choice of the variable to which to backtrack in case of inconsistency, or (ii) as a algorithm in the space of the partial consistent variable assignments. or (iii) as a hybridisation between and . Experiments reported in Pralet and Verfailllie (2004) show that some heuristics...

Flexible measures in production process: A DEA-based approach

Alireza Amirteimoori, Ali Emrouznejad (2011)

RAIRO - Operations Research

Similarity:

Data envelopment analysis (DEA) has been proven as an excellent data-oriented efficiency analysis method for comparing decision making units () with multiple inputs and multiple outputs. In conventional DEA, it is assumed that the status of each measure is clearly known as either input or output. However, in some situations, a performance measure can play input role for some and output role for others. Cook and Zhu [ (2007) 692–699] referred to these variables...