Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Computer Engineering
On Path Consistency For Binary Constraint Satisfaction Problems, Christopher G. Reeson
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 …
Towards Building A Review Recommendation System That Trains Novices By Leveraging The Actions Of Experts, Shilpa Khanal
Towards Building A Review Recommendation System That Trains Novices By Leveraging The Actions Of Experts, Shilpa Khanal
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Online reviews increase consumer visits, increase the time spent on the website, and create a sense of community among the frequent shoppers. Because of the importance of online reviews, online retailers such as Amazon.com and eOpinions provide detailed guidelines for writing reviews. However, though these guidelines provide instructions on how to write reviews, reviewers are not provided instructions for writing product-specific reviews. As a result, poorly-written reviews are abound and a customer may need to scroll through a large number of reviews, which could be up to 6000 pixels down from the top of the page, in order to find …