Sciweavers

717 search results - page 34 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
133 views 101 votes 15 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 views 113 votes 15 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 views 105 votes 15 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...
110 views 102 votes 15 years 6 months ago  CP 2001»
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 ...
98 views 79 votes 15 years 7 months ago  QSIC 2005»
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 ...
85 views 112 votes 15 years 2 months ago  IJCAI 2003»
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
71 views 87 votes 15 years 1 months ago  IPL 2007»
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
92 views 80 votes 15 years 2 months ago  IJCAI 2001»
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
122 views 110 votes 15 years 7 months ago  ECAI 2004»
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
137 views 109 votes 15 years 5 months ago  SPDP 1991»
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...