20 search results - page 2 / 4 » Redundant modeling in permutation weighted constraint satisf... |
CCIA
2007
Springer
13 years 11 months ago
2007
Springer
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...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
CP
2005
Springer
13 years 10 months ago
2005
Springer
In the context of previous work on redundant modeling, permutation problems and matrix modeling, we introduce the notion of partial redundant modeling and categorical channeling co...
CP
1995
Springer
13 years 8 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
TIME
2002
IEEE
13 years 10 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...