Improving the Performance of maxRPC

Details Improving the Performance of maxRPC Improving the Performance of maxRPC

2010-08-30

arxiv.org/abs/1008.5189v1

Computer Science

Artificial Intelligence

Scientific paper

Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRRC algorithms suffer from overheads and redundancies as they can repeatedly perform many constraint checks without triggering any value deletions. In this paper we propose techniques that can boost the performance of maxRPC algorithms. These include the combined use of two data structures to avoid many redundant constraint checks, and heuristics for the efficient ordering and execution of certain operations. Based on these, we propose two closely related algorithms. The first one which is a maxRPC algorithm with optimal O(end^3) time complexity, displays good performance when used stand-alone, but is expensive to apply during search. The second one approximates maxRPC and has O(en^2d^4) time complexity, but a restricted version with O(end^4) complexity can be very efficient when used during search. Both algorithms have O(ed) space complexity. Experimental results demonstrate that the resulting methods constantly outperform previous algorithms for maxRPC, often by large margins, and constitute a more than viable alternative to arc consistency on many problems.

Affiliated with

Also associated with

No associations

Rating

Improving the Performance of maxRPC does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving the Performance of maxRPC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving the Performance of maxRPC will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-179367