Sciweavers

717 search results - page 34 / 144
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
AAAI
2004
14 years 11 months ago
Domain Transmutation in Constraint Satisfaction Problems
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...
James Bowen, Chavalit Likitvivatanavong
CCIA
2007
Springer
15 years 4 months ago
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
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...
Martí Sánchez, Simon de Givry, Thoma...
ANOR
2007
108views more  ANOR 2007»
14 years 10 months ago
Towards a practical engineering tool for rostering
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...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...
CP
2001
Springer
15 years 2 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
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 ...
Jean-Charles Régin, Thierry Petit, Christia...
QSIC
2005
IEEE
15 years 3 months ago
Test Case Generation by OCL Mutation and Constraint Solving
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 ...
Bernhard K. Aichernig, Percy Antonio Pari Salas