V. Kreinovich, A. Lakeyev, J. Rohn, and P. Kahl, Computational complexity and feasi-bility of data processing and interval computations. Kluwer Academic Publishers Netherlands, 1998.

has been cited by the following article:

• TITLE: Comparison of Interval Constraint Propagation Algorithms for Vehicle Localization

  AUTHORS: I. K. Kueviakoe, A. Lambert, P. Tarroux

  KEYWORDS: Interval Analysis, Constraint Propagation, Data Fusion, Vehicle Positioning, GPS

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.5 No.12B, January 25, 2013

  ABSTRACT: Interval constraint propagation (ICP) algorithms allow to solve problems described as constraint satisfaction problems (CSP). ICP has been successfully applied to vehicle localization in the last few years. Once the localization problem has been stated, a large class of ICP solvers can be used. This paper compares a few ICP algorithms, using the same experimental data, in order to rank their performances in terms of accuracy and computing time.