Results 1  10
of
148,676
An ArcConsistency Algorithm for the
 Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), volume 2470 of LNCS
, 2002
"... Historically, discrete minimization problems in constrained logical programming were modeled with the help of an isolated bounding constraint on the objective that is to be decreased. To overcome this frequently inefficient way of searching for improving solutions, the notion of optimization cons ..."
Abstract
 Add to MetaCart
constraints was introduced. Optimization constraints can be viewed as global constraints that link the objective with other constraints of the problem at hand. We present an arcconsistency (actually: hyperarcconsistency) algorithm for the minimum weight all different constraint which is an optimization
Parallelisation of ArcConsistency Algorithms
 IN JORNADAS CHILENAS DE COMPUTACIÓN, 2002. VI WORKSHOP ON DISTRIBUTED SYSTEMS AND PARALLELISM, COPIAPÓCHILE
, 2002
"... This work presents the parallelisation of the AC5 arcconsistency algorithm for two dierent parallel architectures. One is a cluster of PCs and the other is a centralised memory machine (CMM). We conducted our experiments using an adapted version of the PCSOS parallel constraint solving system, ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This work presents the parallelisation of the AC5 arcconsistency algorithm for two dierent parallel architectures. One is a cluster of PCs and the other is a centralised memory machine (CMM). We conducted our experiments using an adapted version of the PCSOS parallel constraint solving system
Lightweight ArcConsistency Algorithms
, 2003
"... Arcconsistency algorithms are the workhorse of many backtrack algorithms. Most research on arcconsistency algorithms is focusing on the design of algorithms that are optimal when it comes to worst case scenarios. This report will provide experimental evidence that, despite common belief to the con ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Arcconsistency algorithms are the workhorse of many backtrack algorithms. Most research on arcconsistency algorithms is focusing on the design of algorithms that are optimal when it comes to worst case scenarios. This report will provide experimental evidence that, despite common belief
Analysis of Distributed ArcConsistency Algorithms
, 1997
"... Consistency techniques can significantly reduce the search space of constraint satisfaction problems (CSP). In particular, arcconsistency algorithms, such as AC3 [7], AC4 [8] and AC6 [2], have been designed. In [9], we presented DisAC4, a coarsegrained parallel algorithm designed for distribut ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
Consistency techniques can significantly reduce the search space of constraint satisfaction problems (CSP). In particular, arcconsistency algorithms, such as AC3 [7], AC4 [8] and AC6 [2], have been designed. In [9], we presented DisAC4, a coarsegrained parallel algorithm designed
DomainHeuristics for ArcConsistency Algorithms
"... a and b become large L will require about 2a + 2b 2 log(a) 0.665492checks on average, where a and b are the domainsizes and log(*) is the base2 logarithm. D requires an average number of supportchecks which is below 2 max(a, b) + 2 if a + b> = 14. Our results demonstrate that D is the superio ..."
Abstract
 Add to MetaCart
a and b become large L will require about 2a + 2b 2 log(a) 0.665492checks on average, where a and b are the domainsizes and log(*) is the base2 logarithm. D requires an average number of supportchecks which is below 2 max(a, b) + 2 if a + b> = 14. Our results demonstrate that D is the superioralgorithm. Finally, we will provide the result that on average D requires strictly
DomainHeuristics for ArcConsistency Algorithms
"... a and b become large L will require about 2a + 2b 2 log(a) 0.665492checks on average, where a and b are the domainsizes and log(*) is the base2 logarithm. D requires an average number of supportchecks which is below 2 max(a, b) + 2 if a + b> = 14. Our results demonstrate that D is the superio ..."
Abstract
 Add to MetaCart
a and b become large L will require about 2a + 2b 2 log(a) 0.665492checks on average, where a and b are the domainsizes and log(*) is the base2 logarithm. D requires an average number of supportchecks which is below 2 max(a, b) + 2 if a + b> = 14. Our results demonstrate that D is the superioralgorithm. Finally, we will provide the result that on average D requires strictly
Ordering Heuristics for Arc Consistency Algorithms
 In AI/GI/VI ’92
, 1992
"... Arc consistency algorithms are used in solving constraint satisfaction problems and are important in constraint logic programming languages. Search order heuristics for arc consistency algorithms significantly enhance the efficiency of their implementation. In this paper we propose and evaluate seve ..."
Abstract

Cited by 51 (3 self)
 Add to MetaCart
Arc consistency algorithms are used in solving constraint satisfaction problems and are important in constraint logic programming languages. Search order heuristics for arc consistency algorithms significantly enhance the efficiency of their implementation. In this paper we propose and evaluate
Queue Representation for Arc Consistency Algorithms
"... Abstract. Arc consistency algorithms are an indispensable tool for efficientlysolving many problems arising in computer science, mathematics, and the real world. Coarsegrained algorithms like AC2001, AC3, and AC3 d are efficientwhen it comes to saving time. Revision ordering heuristics for selec ..."
Abstract
 Add to MetaCart
Abstract. Arc consistency algorithms are an indispensable tool for efficientlysolving many problems arising in computer science, mathematics, and the real world. Coarsegrained algorithms like AC2001, AC3, and AC3 d are efficientwhen it comes to saving time. Revision ordering heuristics
ArcConsistency Algorithms on a Software DSM Platform
 Colloquium on Implementation of Cronstraint and Logic Programming Systems  CICLOPS 2001, (NMSUCSTR003/2001):103–117
, 2001
"... This work presents the parallelisation of the AC5 arcconsistency algorithm for distributedshared memory platforms. We conducted our experiments using an adapted version of the PCSOS parallel system, over nite domains, running on top of Treadmarks, a software DSM system, on a cluster of 8 PCs c ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This work presents the parallelisation of the AC5 arcconsistency algorithm for distributedshared memory platforms. We conducted our experiments using an adapted version of the PCSOS parallel system, over nite domains, running on top of Treadmarks, a software DSM system, on a cluster of 8 PCs
Improving ArcConsistency Algorithms with DoubleSupport Checks
 In Proceedings of the Eleventh Irish Conference on Artificial Intelligence and Cognitive Science
, 2000
"... Arcconsistency algorithms are widely used to simplify Constraint Satisfaction Problems. The new notion of a doublesupport check is presented to improve the average performance of arcconsistency algorithms. The improvement is that, where possible, consistencychecks are used to nd supports for t ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Arcconsistency algorithms are widely used to simplify Constraint Satisfaction Problems. The new notion of a doublesupport check is presented to improve the average performance of arcconsistency algorithms. The improvement is that, where possible, consistencychecks are used to nd supports
Results 1  10
of
148,676