This paper investigates Constraint Satisfaction Problems (CSPs) that axe distributed by nature, i.e., there is a division of the CSP into sub components (agents) that axe connected via constraints,â€¦ (More)

Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach that has been used many times in the past isâ€¦ (More)

The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the probabilities in Bayesâ€¦ (More)

Constraint satisfaction problems (CSP) are part of many real world domains, such as computer vision and scheduling problems. Often, CSPs are solved in real life by several agents, each of themâ€¦ (More)

Many real-life problems in the domain of resource allocation and scheduling require Solutions which are composed of several approaches or techniques. Often, complex problems are divided intoâ€¦ (More)

Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach is to model human knowledge which isâ€¦ (More)

The problem of counting the number of solutions to a constraint network (CN) (also called constraint satisfaction problems, CSPs) is rephrased in terms of probability updating in Bayes networks.â€¦ (More)