![]() ![]() ![]() Number of nodes visited (#NV) Every time you call label Number of Backtracks (#BT) Every un-assignment of a variable in unlabel Number of constraint check (#CC) Every time you call check(i,j) CPU time Be as honest and consistent as possible Optional: Some specific criterion for assessing the quality of the improvement proposed Presentation of values: Descriptive statistics of criterion: average (also, median, mode, max, min) (qualified) run-time distribution Solution-quality distributionĬomparing NV and/or CC Common assumptions: for finding all solutions static/same orderings Choueiry (Shu-we-ri) Avery Hall, Room 360Ģ Outline Evaluation of (deterministic) BT search algorithms CSP parameters Comparison criteria Theoretical evaluations Empirical evaluationsģ p1 = e / emax, e is number of constraintsĬSP parameters Binary: n,a,p1,t Non-binary: n,a,p1,k,t Number of variables: n Domain size: a, d Degree of a variable: deg Arity of the constraints: k Constraint tightness: Proportion of constraints (a.k.a., constraint density, constraint probability) p1 = e / emax, e is number of constraintsĤ Comparison criteria Presentation of values: Presentation on theme: "Evaluation of (Deterministic) BT Search Algorithms"- Presentation transcript:ġ Evaluation of (Deterministic) BT Search Algorithmsįoundations of Constraint Processing CSCE421/821, Fall 2016 All questions to Piazza Berthe Y. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |