Engineering Commons^™

On Path Consistency For Binary Constraint Satisfaction Problems, Christopher G. Reeson

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Constraint satisfaction problems (CSPs) provide a flexible and powerful framework for modeling and solving many decision problems of practical importance. Consistency properties and the algorithms for enforcing them on a problem instance are at the heart of Constraint Processing and best distinguish this area from other areas concerned with the same combinatorial problems. In this thesis, we study path consistency (PC) and investigate several algorithms for enforcing it on binary finite CSPs. We also study algorithms for enforcing consistency properties that are related to PC but are stronger or weaker than PC.

We identify and correct errors in the literature …

Learning Path Adaptation In Online Learning Systems, Alva Hendi Muhammad, Qingguo Zhou, Ghassan Beydoun, Dongming Xu, Jun Shen

Faculty of Engineering and Information Sciences - Papers: Part A

Learning path in online learning systems refers to a sequence of learning objects which are designated to help the students in improving their knowledge or skill in particular subjects or degree courses. In this paper, we review the recent research on learning path adaptation to pursue two goals, first is to organize and analyze the parameter of adaptation in learning path; the second is to discuss the challenges in implementing learning path adaptation. The survey covers the state of the art and aims at providing a comprehensive introduction to the learning path adaptation for researchers and practitioners.