Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems

Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems

Paparrizou, Anastasia

Paperback

General Computers

ISBN10: 1329010094
ISBN13: 9781329010093
Publisher: Lulu Pr
Published: Mar 23 2015
Pages: 166
Weight: 0.68
Height: 0.35 Width: 7.44 Depth: 9.69
Language: English
Constraint programming is a successful technology for solving a wide range of problems in business and industry which require satisfying a set of constraints. Central to solving constraint satisfaction problems is enforcing a level of local consistency. In this thesis, we propose efficient filtering algorithms for enforcing strong local consistencies. In addition, since such filtering algorithms can be too expensive to enforce all the time, we propose some automated heuristics that can dynamically select the most appropriate filtering algorithm. Published by AI Access, a not-for-profit publisher of open access texts with a highly respected scientific board. We publish monographs and collected works. Our texts are available electronically for free and in hard copy at close to cost.

Also in

General Computers

View All