๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Comments on Mohr and Henderson's path consistency algorithm

โœ Scribed by Ching-Chih Han; Chia-Hoang Lee

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
216 KB
Volume
36
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis

Mohr and Henderson have presented new algorithms for arc and path consistency in

[1]

. Though the underlying ideas of their algorithms are correct, the path consistency algorithm PC-3 is in error. In this paper we point out the errors in this algorithm and give a correct one. The time complexity and space complexity of the revised algorithm are also analyzed.

๐Ÿ“œ SIMILAR VOLUMES

Arc and path consistency revisited
Arc and path consistency revisited
โœ Roger Mohr; Thomas C. Henderson ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 366 KB
Comments on the NIPALS algorithm
Comments on the NIPALS algorithm
โœ Yoshikatsu Miyashita; Toshiaki Itozawa; Hiroyuki Katsumi; Shin-Ichi Sasaki ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 192 KB
Comments on the PLS kernel algorithm
Comments on the PLS kernel algorithm
โœ Sijmen De Jong; Cajo J. F. Ter Braak ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 355 KB

Lindgren et al. ( J . Chemometrics, 7 , 45-59 (1993)) published a so-called kernel algorithm for PLS regression of Y against X when the number of objects is very large. The algorithm is based solely on deflation of the cross-product matrices XTX, YTY and XTY. The algorithm is now described in a shor

On-line algorithm for optimal 3D path pl
On-line algorithm for optimal 3D path planning
โœ Chien-Wan Hun; Hun-Chen Chen; Ming-Fung Hwang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 927 KB

The issues of automatic car operation aiming at in an unknown complex terrain are the most effective path planning and the obstacles avoiding in this complex terrain. For that, an on-line algorithm for guiding a mobile object in an unexplored terrain filled with convex polygonal obstacles is present

On the all-pairs shortest-path algorithm
On the all-pairs shortest-path algorithm of Moffat and Takaoka
โœ Kurt Mehlhorn; Volker Priebe ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 213 KB ๐Ÿ‘ 3 views

We review how to solve the all-pairs shortest-path problem in a nonnegatively ลฝ 2 . weighted digraph with n vertices in expected time O n log n . This bound is shown to hold with high probability for a wide class of probability distributions on nonnegatively weighted ลฝ . digraphs. We also prove that