کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4634926 | 1340703 | 2008 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A non-binary constraint ordering heuristic for constraint satisfaction problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A non-binary constraint ordering heuristic for constraint satisfaction problems A non-binary constraint ordering heuristic for constraint satisfaction problems](/preview/png/4634926.png)
چکیده انگلیسی
Furthermore, the order in which constraints are studied can improve efficiency, particularly in problems with non-binary constraints. In this paper, we present a preprocess heuristic called constraint ordering heuristic (COH) that studies the constrainedness of the scheduling problem and mainly classifies the constraints so that the tightest ones are studied first. Thus, constrainedness can be known in advance and overall inconsistencies can be found earlier and the number of constraint checks can significantly be reduced.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 198, Issue 1, 15 April 2008, Pages 280-295
Journal: Applied Mathematics and Computation - Volume 198, Issue 1, 15 April 2008, Pages 280-295
نویسندگان
Miguel A. Salido,