Toward an automaton Constraint for Local Search

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.4204/EPTCS.5.2

We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search). We show how it is possible to maintain incrementally the violations of a constraint and its decision variables from an automaton that describes a ground checker for that constraint. We establish the practicality of our approach idea on real-life personnel rostering problems, and show that it is competitive with the approach of [Pralong, 2007].

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Toward an automaton Constraint for Local Search 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 Toward an automaton Constraint for Local Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Toward an automaton Constraint for Local Search will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-36297

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.