Nicolas Prcovic  Home/Search
Context
Related
| inria.fr/cermics/con...tai96_full.ps.gz sop.inria.fr/cermics...tai96_full.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: inria.fr/cermics/contrain...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new distributed algorithm which finds all solutions of Constraint Satisfaction Problems. Based on the Backtrack algorithm, it spreads subtrees of the search tree over processes running in parallel. The work is optimally shared among the processes while the communication cost remains low. We show that the speedup of the resolution is asymptotically linear as the number of v ariables increases. Furthermore, we study the addition of Lookahead pruning techniques and Nogood Recording.... (Update)
Similar documents (at the sentence level):
11.6%: A Distributed Algorithm Solving CSPs with a Low Communication Cost - Prcovic (Correct)
Active bibliography (related documents): More All
1.1: Changing the Distribution Depth During a Parallel Tree Search - Prcovic (Correct)
0.6: Parallélisation de la recherche arborescente des CSP.. - Prcovic, Neveu (Correct)
0.3: From Modular to Distributed Architectures: Centaur and Smeci.. - Dery, Lejouad (1994) (Correct)
Similar documents based on text: More All
0.1: NoGood Caching for MultiAgent Backtrack Search - Havens (Correct)
0.1: The Effect of Nogood Learning in Distributed Constraint.. - Hirayama (2000) (Correct)
0.1: Recherche Arborescente Restreinte Un Sous-Espace Prometteur - Prcovic, Neveu (Correct)
BibTeX entry: (Update)
@misc{ prcovic-distributed,
author = "Nicolas Prcovic",
title = "A Distributed Algorithm Solving CSPs with a Low Communication Cost",
url = "citeseer.ist.psu.edu/82575.html" }
Citations (may not include all citations):473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
37 ACM Transaction on Programming Languages and Systems (context) - Finkel, Manber et al. - 1987
32 A Parallel Implementation of Itera tive-Deepening (context) - Kumar, Rao et al. - 1987
18 Parallel Algorithms for Combinatorial Search Problems (context) - Zhang - 1989
12 Nogood Recording for static and dynamic CSP (context) - Schiex, Verfaillie - 1994
11 Parallel constraint satisfaction in logic programming : Prel.. (context) - Van Hentenryck - 1989
4 Parallel branch and bound algorithms (context) - Roucairol - 1989
4 Experimental case studies of Backtrack vs Waltz-type vs new .. (context) - Gaschnig - 1978
3 CHOOE : Un gestionnaire d'environnement distribu (context) - Lebastard - 1993
3 l'algorithmique non num#rique parall#le : parall#lisations d.. (context) - Mans - 1992
2 Performances des algorithmes branch and bound par all#les # .. (context) - Mans, Roucairol - 1992
1 PROSE: Une bo#te # outils fonctionnelle pour l'interpr#tatio.. (context) - Berlandier - 1992
1 solution des probl#mes d'implantation : algorithmes s#quenti.. (context) - Mautor, la - 1993
1 Static partioning with slackness (context) - Suttner - 1995
1 Distributed Tree Search and its Application to Al pha-Beta P.. (context) - Fergusson, Korf - 1988
Documents on the same site (http://www.inria.fr/cermics/contraintes/personnel/prcovic/index.html): More
Changing the Distribution Depth During a Parallel Tree Search - Prcovic (Correct)
A Distributed Algorithm Solving CSPs with a Low Communication Cost - Prcovic (Correct)
Recherche Arborescente Restreinte Un Sous-Espace Prometteur - Prcovic, Neveu (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC