Results 1  10
of
1,944,142
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
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.
© 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
ArcConsistency and ArcConsistency Again
 Artificial Intelligence
, 1994
"... Constraint networks are known as a useful way to formulate problems such as design, scene labeling, temporal reasoning, and more recently natural language parsing. The problem of the existence of solutions in a constraint network is NPcomplete. Hence, consistency techniques have been widely studied ..."
Abstract

Cited by 151 (12 self)
 Add to MetaCart
studied to simplify constraint networks before or during the search of solutions. Arcconsistency is the most used of them. Mohr and Henderson [Moh&Hen86] have proposed AC4, an algorithm having an optimal worstcase time complexity. But it has two drawbacks: its space complexity and its average time
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 ..."
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.
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
, 2010
"... ..."
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
Results 1  10
of
1,944,142