Activity-Based Search for Black-Box Contraint-Programming Solvers

Details Activity-Based Search for Black-Box Contraint-Programming Solvers Activity-Based Search for Black-Box Contraint-Programming Solvers

2011-05-31

arxiv.org/abs/1105.6314v1

Computer Science

Artificial Intelligence

Scientific paper

Robust search procedures are a central component in the design of black-box constraint-programming solvers. This paper proposes activity-based search, the idea of using the activity of variables during propagation to guide the search. Activity-based search was compared experimentally to impact-based search and the WDEG heuristics. Experimental results on a variety of benchmarks show that activity-based search is more robust than other heuristics and may produce significant improvements in performance.

Affiliated with

Also associated with

No associations

Rating

Activity-Based Search for Black-Box Contraint-Programming Solvers 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 Activity-Based Search for Black-Box Contraint-Programming Solvers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Activity-Based Search for Black-Box Contraint-Programming Solvers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338748