Results 1  10
of
269,443
Optimal Distributed ArcConsistency
 In Proceedings of CP’99
, 1999
"... This paper presents DisAC9, the rst optimal distributed algorithm performing the arcconsistency of a constraint network. Our method is optimal according to the number of message passing operations. ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
This paper presents DisAC9, the rst optimal distributed algorithm performing the arcconsistency of a constraint network. Our method is optimal according to the number of message passing operations.
Optimal Distributed ArcConsistency
 In Proceedings of CP’99
, 1999
"... This paper presents DisAC9, the rst optimal distributed algorithm performing the arcconsistency of a constraint network. Our method is optimal according to the number of message passing operations. This algorithm can rstly, give speedup over the fastest central arcconsistency algorithms; secon ..."
Abstract
 Add to MetaCart
This paper presents DisAC9, the rst optimal distributed algorithm performing the arcconsistency of a constraint network. Our method is optimal according to the number of message passing operations. This algorithm can rstly, give speedup over the fastest central arcconsistency algorithms
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 ..."
© 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. Optimal Distributed ArcConsistency
"... Abstract. This paper presents DisAC9, the first optimal distributed algorithm performing the arcconsistency of a constraint network. Our method is optimal according to the number of message passing operations. This algorithm can firstly, give speedup over the fastest central arcconsistency algor ..."
Abstract
 Add to MetaCart
Abstract. This paper presents DisAC9, the first optimal distributed algorithm performing the arcconsistency of a constraint network. Our method is optimal according to the number of message passing operations. This algorithm can firstly, give speedup over the fastest central arcconsistency
A Generic ArcConsistency Algorithm and its Specializations
 Artificial Intelligence
, 1992
"... Consistency techniques have been studied extensively in the past as a way of tackling constraint satisfaction problems (CSP). In particular, various arcconsistency algorithms have been proposed, originating from Waltz's filtering algorithm [26] and culminating in the optimal algorithm AC4 of ..."
Abstract

Cited by 213 (8 self)
 Add to MetaCart
Consistency techniques have been studied extensively in the past as a way of tackling constraint satisfaction problems (CSP). In particular, various arcconsistency algorithms have been proposed, originating from Waltz's filtering algorithm [26] and culminating in the optimal algorithm AC4
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
the performance of the system. We implemented dierent kinds of partitioning for the constraints, and dierent kinds of distributed labeling that are not present in the original version. Our results show that arcconsistency algorithms have very good speedups on centralised memory systems, and have a great
Parallel ArcConsistency for Functional Constraints
"... We present in this paper a parallel execution model of arcconsistency for Constraint Satisfaction Problems (CSP), implemented on a scaleable MIMD distributed memory machine. We have adopted the indexical scheme, an adequate approach to arcconsistency for functional constraints. The CSP is parti ..."
Abstract
 Add to MetaCart
We present in this paper a parallel execution model of arcconsistency for Constraint Satisfaction Problems (CSP), implemented on a scaleable MIMD distributed memory machine. We have adopted the indexical scheme, an adequate approach to arcconsistency for functional constraints. The CSP
DISTRIBUTED SYSTEMS
, 1985
"... Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence. ..."
Abstract

Cited by 755 (1 self)
 Add to MetaCart
Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence.
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 766 (29 self)
 Add to MetaCart
Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We
Estimating Continuous Distributions in Bayesian Classifiers
 In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence
, 1995
"... When modeling a probability distribution with a Bayesian network, we are faced with the problem of how to handle continuous variables. Most previous work has either solved the problem by discretizing, or assumed that the data are generated by a single Gaussian. In this paper we abandon the normality ..."
Abstract

Cited by 489 (2 self)
 Add to MetaCart
When modeling a probability distribution with a Bayesian network, we are faced with the problem of how to handle continuous variables. Most previous work has either solved the problem by discretizing, or assumed that the data are generated by a single Gaussian. In this paper we abandon
Results 1  10
of
269,443