The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
130 views121 votes15 years 5 months ago ECAI 2000»
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
133 views101 votes15 years 2 months ago AAAI 2004»
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
107 views113 votes15 years 7 months ago CCIA 2007»
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
108 views105 votes15 years 1 months ago ANOR 2007»
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Fault-based testing is a technique where testers anticipate errors in a system under test in order to assess or generate test cases. The idea is to have enough test cases capable ...