-
1
-
-
0035479320
-
Random constraint satisfaction: a more accurate picture
-
Achlioptas D., Molloy M.S.O., Kirousis L.M., Stamatiou Y.C., Kranakis E., and Krizanc D. Random constraint satisfaction: a more accurate picture. Constraints 6 4 (2001) 329-344
-
(2001)
Constraints
, vol.6
, Issue.4
, pp. 329-344
-
-
Achlioptas, D.1
Molloy, M.S.O.2
Kirousis, L.M.3
Stamatiou, Y.C.4
Kranakis, E.5
Krizanc, D.6
-
4
-
-
0028195184
-
Identification of β-sheet motifs, of ψ-loops and of patterns of amino-acid residues in three-dimensional protein structures using a subgraph-isomorphism algorithm
-
Artymiuk P.J., Grindley H.M., Poirrette A.R., Rice D.W., Ujah E.C., and Willett P. Identification of β-sheet motifs, of ψ-loops and of patterns of amino-acid residues in three-dimensional protein structures using a subgraph-isomorphism algorithm. J. Chem. Inform. Comput. Sci. 34 (1994) 54-62
-
(1994)
J. Chem. Inform. Comput. Sci.
, vol.34
, pp. 54-62
-
-
Artymiuk, P.J.1
Grindley, H.M.2
Poirrette, A.R.3
Rice, D.W.4
Ujah, E.C.5
Willett, P.6
-
5
-
-
0018443029
-
Implementing a relational database by means of specialized hardware
-
Babb E. Implementing a relational database by means of specialized hardware. ACM Trans. Database Syst. 4 (1979) 1-29
-
(1979)
ACM Trans. Database Syst.
, vol.4
, pp. 1-29
-
-
Babb, E.1
-
6
-
-
29844440778
-
-
B. Babcock, S. Chaudhuri, Towards a robust query optimizer: a principled and practical approach, in: Proceedings ACM SIGMOD, Baltimore, MD, 2005, pp. 119-130.
-
-
-
-
7
-
-
84958063124
-
Dynamic variable ordering in CSPs
-
Springer, New York pp. 258-275
-
Bacchus F., and van Run P. Dynamic variable ordering in CSPs. Lecture Notes in Computer Science vol. 976 (1995), Springer, New York pp. 258-275
-
(1995)
Lecture Notes in Computer Science
, vol.976
-
-
Bacchus, F.1
van Run, P.2
-
8
-
-
0031643560
-
-
F. Bacchus, P. van Beek, On the conversion between non-binary and binary constraint satisfaction problems, in: Proceedings of AAAI'98, Madison, WI, 1998, pp. 310-318.
-
-
-
-
10
-
-
0033742658
-
-
S. Bandyopadhyay, Q. Fu, A. Sengupta, A cyclic multi-relation semijoin operation for query optimization in distributed databases, in: Proceedings of IEEE International Conference on Performance, Computing, and Communications (IPCCC'00), 2000, pp. 101-107.
-
-
-
-
11
-
-
34250782585
-
Constraint programming lessons learned from crossword puzzles
-
Springer, New York pp. 78-87
-
Beacham A., Chen X., Sillito J., and van Beek P. Constraint programming lessons learned from crossword puzzles. Lecture Notes in Computer Science vol. 2056 (2001), Springer, New York pp. 78-87
-
(2001)
Lecture Notes in Computer Science
, vol.2056
-
-
Beacham, A.1
Chen, X.2
Sillito, J.3
van Beek, P.4
-
12
-
-
84976793960
-
Using semi-joins to solve relational queries
-
Bernstein P.A., and Chiu D.-M.W. Using semi-joins to solve relational queries. JACM 28 1 (1981) 25-40
-
(1981)
JACM
, vol.28
, Issue.1
, pp. 25-40
-
-
Bernstein, P.A.1
Chiu, D.-M.W.2
-
13
-
-
84957890248
-
-
C. Bessière, J.C. Régin, MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems, in: Proceedings of CP'96, Cambridge, MA, 1996, pp. 61-75.
-
-
-
-
14
-
-
84880861453
-
-
C. Bessière, J.C. Régin, Refining the basic arc consistency algorithm, in: Proceedings of IJCAI-01, Seattle, WA, 2001, pp. 309-315.
-
-
-
-
16
-
-
0030859809
-
Representation and searching of carbohydrate structures using graph-theoretic techniques
-
Bruno I.J., Kemp N.M., Artymiuk P.J., and Willett P. Representation and searching of carbohydrate structures using graph-theoretic techniques. Carbohyd. Res. 304 (1997) 61-67
-
(1997)
Carbohyd. Res.
, vol.304
, pp. 61-67
-
-
Bruno, I.J.1
Kemp, N.M.2
Artymiuk, P.J.3
Willett, P.4
-
17
-
-
0022769976
-
Graph-based algorithms for Boolean function manipulation
-
Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35 (1986) 677-691
-
(1986)
IEEE Trans. Comput.
, vol.C-35
, pp. 677-691
-
-
Bryant, R.E.1
-
18
-
-
0026913667
-
Symbolic Boolean manipulation with ordered binary-decision diagrams
-
Bryant R.E. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24 (1992) 293-318
-
(1992)
ACM Comput. Surv.
, vol.24
, pp. 293-318
-
-
Bryant, R.E.1
-
21
-
-
0019611334
-
Analysis of a heuristic for full trie minimization
-
Comer D. Analysis of a heuristic for full trie minimization. ACM Trans. Database Syst. 6 (1981) 513-537
-
(1981)
ACM Trans. Database Syst.
, vol.6
, pp. 513-537
-
-
Comer, D.1
-
22
-
-
0038844792
-
Estimating optimal parameters for parallel database hardware
-
Cooper M.C. Estimating optimal parameters for parallel database hardware. Int. J. Syst. Sci. 23 (1992) 119-125
-
(1992)
Int. J. Syst. Sci.
, vol.23
, pp. 119-125
-
-
Cooper, M.C.1
-
25
-
-
34250728495
-
-
A. Dechter, R. Dechter, Removing redundancies in constraint networks, in: Proceedings of the AAAI-87, Seattle, WA, 1987, pp. 105-109.
-
-
-
-
26
-
-
0023842374
-
Network-based heuristics for constraint-satisfaction problems
-
Dechter R., and Pearl J. Network-based heuristics for constraint-satisfaction problems. Artif. Intell. 34 (1988) 1-38
-
(1988)
Artif. Intell.
, vol.34
, pp. 1-38
-
-
Dechter, R.1
Pearl, J.2
-
27
-
-
0024640050
-
Tree clustering for constraint networks
-
Dechter R., and Pearl J. Tree clustering for constraint networks. Artif. Intell. 38 (1989) 253-266
-
(1989)
Artif. Intell.
, vol.38
, pp. 253-266
-
-
Dechter, R.1
Pearl, J.2
-
28
-
-
1642312636
-
Mini-buckets: a general scheme for bounded inference
-
Dechter R., and Rish I. Mini-buckets: a general scheme for bounded inference. JACM 50 (2003) 107-153
-
(2003)
JACM
, vol.50
, pp. 107-153
-
-
Dechter, R.1
Rish, I.2
-
30
-
-
34250694849
-
-
D. Frost, R. Dechter, Look-ahead value ordering for constraint satisfaction problems, in: Proceedings of IJCAI'95, Montreal, Canada, 1995, pp. 572-578.
-
-
-
-
31
-
-
0033263280
-
Maintenance scheduling problems as benchmarks for constraint algorithms
-
Frost D., and Dechter R. Maintenance scheduling problems as benchmarks for constraint algorithms. Ann. Math. Artif. Intell. 26 (1999) 149-170
-
(1999)
Ann. Math. Artif. Intell.
, vol.26
, pp. 149-170
-
-
Frost, D.1
Dechter, R.2
-
32
-
-
0028446463
-
-
A. Galindo-Legaria, Outerjoins as disjunctions, in: Proceedings of the 1994 ACM SIGMOD Conference, Minneapolis, MN, 1994, pp. 348-358.
-
-
-
-
33
-
-
0013084629
-
-
Prentice Hall, Upper Saddle River, NJ
-
Garcia-Molina H., Ullman J.D., and Widom J. Database Systems: The Complete Book (2002), Prentice Hall, Upper Saddle River, NJ
-
(2002)
Database Systems: The Complete Book
-
-
Garcia-Molina, H.1
Ullman, J.D.2
Widom, J.3
-
34
-
-
0035479063
-
Random constraint satisfaction: flaws and structure
-
Gent I.P., Macintyre E., Prosser P., Smith B.M., and Walsh T. Random constraint satisfaction: flaws and structure. Constraints 6 (2001) 345-372
-
(2001)
Constraints
, vol.6
, pp. 345-372
-
-
Gent, I.P.1
Macintyre, E.2
Prosser, P.3
Smith, B.M.4
Walsh, T.5
-
35
-
-
34250759752
-
-
M. Ginsberg, M. Frank, M. Halpin, M. Torrance, Search lessons learned from crossword puzzles, in: Proceedings of AAAI-90, Boston, MA, 1990, pp. 210-215.
-
-
-
-
36
-
-
0000260998
-
Backtrack programming
-
Golomb S.W., and Baumert L.D. Backtrack programming. JACM 12 4 (1965) 516-524
-
(1965)
JACM
, vol.12
, Issue.4
, pp. 516-524
-
-
Golomb, S.W.1
Baumert, L.D.2
-
38
-
-
0028400405
-
Decomposing constraint satisfaction problems using database techniques
-
Gyssens M., Jeavons P.G., and Cohen D.A. Decomposing constraint satisfaction problems using database techniques. Artif. Intell. 66 (1994) 57-89
-
(1994)
Artif. Intell.
, vol.66
, pp. 57-89
-
-
Gyssens, M.1
Jeavons, P.G.2
Cohen, D.A.3
-
39
-
-
34250723241
-
-
T. Hadzic, S. Subbarayan, R.M. Jensen, H.R. Andersen, J. Møller, H. Hulgaard, Fast backtrack-free product configuration using a precompiled solution space representation, in: Proceedings of International Conference on Economic, Technical and Organisational Aspects of Product Configuration Systems, Copenhagen, 2004, pp. 131-138.
-
-
-
-
41
-
-
0019067870
-
Increasing tree search efficiency for constraint satisfaction problems
-
Haralick R.M., and Elliott G.L. Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14 (1980) 263-313
-
(1980)
Artif. Intell.
, vol.14
, pp. 263-313
-
-
Haralick, R.M.1
Elliott, G.L.2
-
43
-
-
3142708793
-
-
I.F. Ilyas, V. Markl, P. Haas, P. Brown, A. Aboulnaga, CORDS: automatic discovery of correlations and soft functional dependencies, in: Proceedings of ACM SIGMOD, Paris, France, 2004, pp. 647-658.
-
-
-
-
44
-
-
0024914621
-
-
P. Janssen, P. Jégou, R. Nouguier, M.C. Vilarem, A filtering process for general constraint satisfaction problems, in: Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence, Fairfax, VA, 1989, pp. 420-427.
-
-
-
-
45
-
-
0000500922
-
State of the art in distributed query processing
-
Kossmann D. State of the art in distributed query processing. ACM Comp. Surv. 32 (2000) 422-469
-
(2000)
ACM Comp. Surv.
, vol.32
, pp. 422-469
-
-
Kossmann, D.1
-
46
-
-
0002103528
-
Iterative dynamic programming: a new class of query optimization algorithms
-
Kossmann D., and Stocker K. Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans. Database Syst. 25 (2001) 43-82
-
(2001)
ACM Trans. Database Syst.
, vol.25
, pp. 43-82
-
-
Kossmann, D.1
Stocker, K.2
-
47
-
-
0041781747
-
Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
-
Larrosa J., and Dechter R. Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Constraints 8 (2003) 303-326
-
(2003)
Constraints
, vol.8
, pp. 303-326
-
-
Larrosa, J.1
Dechter, R.2
-
48
-
-
27344446696
-
On the practical use of variable elimination in constraint optimization problems: 'Still-life' as a case study
-
Larrosa J., Morancho E., and Niso D. On the practical use of variable elimination in constraint optimization problems: 'Still-life' as a case study. J. Artif. Intell. Res. 23 (2005) 421-440
-
(2005)
J. Artif. Intell. Res.
, vol.23
, pp. 421-440
-
-
Larrosa, J.1
Morancho, E.2
Niso, D.3
-
49
-
-
16244398026
-
-
C. Lecoutre, F. Boussemart, F. Hemery, Backjump-based techniques versus conflict directed heuristics, in: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004, pp. 549-557.
-
-
-
-
50
-
-
0029456316
-
-
Z. Li, K.A. Ross, PERF join: an alternative to two-way semijoin and bloomjoin, in: Proceedings of the Fourth International Conference on Information and Knowledge Management, Baltimore, MD, 1995, pp. 137-144.
-
-
-
-
51
-
-
0037212944
-
An overview of backtrack search satisfiability algorithms
-
Lynce I., and Marques-Silva J.P. An overview of backtrack search satisfiability algorithms. Ann. Math. Artif. Intell. 37 3 (2003) 307-326
-
(2003)
Ann. Math. Artif. Intell.
, vol.37
, Issue.3
, pp. 307-326
-
-
Lynce, I.1
Marques-Silva, J.P.2
-
52
-
-
49449120803
-
Consistency in networks of relations
-
Mackworth A.K. Consistency in networks of relations. Artif. Intell. 8 1 (1977) 99-118
-
(1977)
Artif. Intell.
, vol.8
, Issue.1
, pp. 99-118
-
-
Mackworth, A.K.1
-
54
-
-
84947944781
-
Solving non-binary CSPs using the hidden variable encoding
-
Proceedings of CP 2001. Walsh T. (Ed), Springer, Berlin
-
Mamoulis N., and Stergiou K. Solving non-binary CSPs using the hidden variable encoding. In: Walsh T. (Ed). Proceedings of CP 2001. Lecture Notes in Computer Science vol. 2239 (2001), Springer, Berlin 168-182
-
(2001)
Lecture Notes in Computer Science
, vol.2239
, pp. 168-182
-
-
Mamoulis, N.1
Stergiou, K.2
-
55
-
-
3142774985
-
-
V. Markl, V. Raman, D. Simmen, G. Lohman, H. Pirahesh, M. Cilimdzic, Robust query processing through progressive optimization, in: Proceedings of ACM SIGMOD Conference, Paris, France, 2004, pp. 659-670.
-
-
-
-
56
-
-
0022147831
-
Parallel computer architectures and problem solving strategies for the consistent labelling problem
-
McCall J.T., Tront J.G., Gray F.G., Haralick R.M., and McCormack W.M. Parallel computer architectures and problem solving strategies for the consistent labelling problem. IEEE Trans. Comput. C-34 (1985) 973-980
-
(1985)
IEEE Trans. Comput.
, vol.C-34
, pp. 973-980
-
-
McCall, J.T.1
Tront, J.G.2
Gray, F.G.3
Haralick, R.M.4
McCormack, W.M.5
-
57
-
-
0018730719
-
Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
-
McGregor J.J. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inform. Sci. 19 (1979) 229-250
-
(1979)
Inform. Sci.
, vol.19
, pp. 229-250
-
-
McGregor, J.J.1
-
58
-
-
0026826969
-
Join processing in relational databases
-
Mishra P., and Eich M.H. Join processing in relational databases. ACM Comput. Surv. 24 (1992) 63-113
-
(1992)
ACM Comput. Surv.
, vol.24
, pp. 63-113
-
-
Mishra, P.1
Eich, M.H.2
-
60
-
-
0016050041
-
Networks of constraints: Fundamental properties and applications to picture processing
-
Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. 7 (1974) 95-132
-
(1974)
Inform. Sci.
, vol.7
, pp. 95-132
-
-
Montanari, U.1
-
61
-
-
0033698537
-
-
J.M. Morrissey, W.K. Osborn, Y. Liang, Collisions and reduction filters in distributed query processing, in: Proceedings of 2000 Canadian Conference on Electrical and Computer Engineering, Halifax, Nova Scotia, vol. 1, 2000, pp. 240-244.
-
-
-
-
62
-
-
0025432881
-
Optimal semijoins for distributed database systems
-
Mullin J.K. Optimal semijoins for distributed database systems. IEEE Trans. Software Eng. 16 (1990) 558-560
-
(1990)
IEEE Trans. Software Eng.
, vol.16
, pp. 558-560
-
-
Mullin, J.K.1
-
64
-
-
84880877579
-
-
N. Narodytska, T. Walsh, Constraint and variable ordering heuristics for compiling configuration problems, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007, pp. 149-154.
-
-
-
-
65
-
-
0030110022
-
An empirical study of phase transitions in binary constraint satisfaction problems
-
Prosser P. An empirical study of phase transitions in binary constraint satisfaction problems. Artif. Intell. 81 (1996) 81-109
-
(1996)
Artif. Intell.
, vol.81
, pp. 81-109
-
-
Prosser, P.1
-
66
-
-
85016909176
-
-
D. Sabin, E.C. Freuder, Contradicting conventional wisdom in constraint satisfaction, in: A. Borning (Ed.), Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, PPCP'94, Rosario, Orcas Island, Washington, published as Lecture Notes in Computer Science, vol. 874, 1994, pp. 10-20.
-
-
-
-
67
-
-
31144435836
-
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
-
Samaras N., and Stergiou K. Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results. J. Artif. Intell. Res. 24 (2005) 641-684
-
(2005)
J. Artif. Intell. Res.
, vol.24
, pp. 641-684
-
-
Samaras, N.1
Stergiou, K.2
-
68
-
-
85051567368
-
-
P.G. Selinger, M.M. Astrahan, D.D. Chamberlin, R.A. Lorie, T.G. Price, Access path selection in a relational database management system, in: Proceedings of ACM 1979 SIGMOD Conference, Boston, MA, 1979, pp. 23-34.
-
-
-
-
69
-
-
84976660052
-
Join processing in database systems with large main memories
-
Shapiro L.D. Join processing in database systems with large main memories. ACM Trans. Database Syst. 11 (1986) 239-264
-
(1986)
ACM Trans. Database Syst.
, vol.11
, pp. 239-264
-
-
Shapiro, L.D.1
-
70
-
-
0030105626
-
Locating the phase transition in binary constraint satisfaction problems
-
Smith B.M., and Dyer M.E. Locating the phase transition in binary constraint satisfaction problems. Artif. Intell. 81 (1996) 155-181
-
(1996)
Artif. Intell.
, vol.81
, pp. 155-181
-
-
Smith, B.M.1
Dyer, M.E.2
-
71
-
-
0032596636
-
-
K. Stergiou, T. Walsh, Encodings of non-binary constraint satisfaction problems, in: Proceedings of AAAI'99, 1999, pp. 163-168.
-
-
-
-
72
-
-
34250775946
-
-
S. Subbarayan, R.M. Jensen, T. Hadzic, H.R. Andersen, J. Møller, H. Hulgaard, Comparing two implementations of a complete and backtrack-free interactive configurator, in: Proceedings of the CP-04 Workshop on CSP Techniques with Immediate Application, Toronto, Canada, 2004, pp. 97-111.
-
-
-
-
73
-
-
0021473698
-
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
-
Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13 (1984) 566-579
-
(1984)
SIAM J. Comput.
, vol.13
, pp. 566-579
-
-
Tarjan, R.E.1
Yannakakis, M.2
-
75
-
-
0344034474
-
Associating parts of patterns
-
Ullmann J.R. Associating parts of patterns. Inform. Control 9 6 (1966) 583-601
-
(1966)
Inform. Control
, vol.9
, Issue.6
, pp. 583-601
-
-
Ullmann, J.R.1
-
76
-
-
0016870630
-
An algorithm for subgraph isomorphism
-
Ullmann J.R. An algorithm for subgraph isomorphism. JACM 23 1 (1976) 31-42
-
(1976)
JACM
, vol.23
, Issue.1
, pp. 31-42
-
-
Ullmann, J.R.1
-
77
-
-
0010111194
-
A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
-
Ullmann J.R. A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words. Comput. J. 20 2 (1977) 141-147
-
(1977)
Comput. J.
, vol.20
, Issue.2
, pp. 141-147
-
-
Ullmann, J.R.1
-
78
-
-
34250732767
-
A relational view of text image processing
-
Haralick R.M., and Simon J.C. (Eds), Sijthoff and Noordhoff, Alphen aan den Rijn, The Netherlands
-
Ullmann J.R. A relational view of text image processing. In: Haralick R.M., and Simon J.C. (Eds). Issues in Digital Image Processing (1980), Sijthoff and Noordhoff, Alphen aan den Rijn, The Netherlands 139-169
-
(1980)
Issues in Digital Image Processing
, pp. 139-169
-
-
Ullmann, J.R.1
-
79
-
-
0020183235
-
Discrete optimization by relational constraint satisfaction
-
Ullmann J.R. Discrete optimization by relational constraint satisfaction. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4 5 (1982) 544-550
-
(1982)
IEEE Trans. Pattern Anal. Mach. Intell.
, vol.PAMI-4
, Issue.5
, pp. 544-550
-
-
Ullmann, J.R.1
-
80
-
-
0023995937
-
Fast implementation of relational operations via inverse projection
-
Ullmann J.R. Fast implementation of relational operations via inverse projection. Comput. J. 31 2 (1988) 147-154
-
(1988)
Comput. J.
, vol.31
, Issue.2
, pp. 147-154
-
-
Ullmann, J.R.1
-
81
-
-
0022062356
-
Computer architecture for solving consistent labeling problems
-
Ullmann J.R., Haralick R.M., and Shapiro L.G. Computer architecture for solving consistent labeling problems. Comput. J. 28 2 (1985) 105-111
-
(1985)
Comput. J.
, vol.28
, Issue.2
, pp. 105-111
-
-
Ullmann, J.R.1
Haralick, R.M.2
Shapiro, L.G.3
-
82
-
-
0026941401
-
A generic arc-consistency algorithm and its specializations
-
Van Hentenryck P., Deville Y., and Tang C.-M. A generic arc-consistency algorithm and its specializations. Artif. Intell. 57 (1992) 291-321
-
(1992)
Artif. Intell.
, vol.57
, pp. 291-321
-
-
Van Hentenryck, P.1
Deville, Y.2
Tang, C.-M.3
-
83
-
-
0033705777
-
-
M.Y. Vardi, Constraint satisfaction and database theory: a tutorial, in: Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, 2000, pp. 76-85.
-
-
-
-
84
-
-
34250754860
-
-
I. Wegener, Branching programs and binary decision diagrams, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 2000.
-
-
-
-
85
-
-
0035643599
-
An average analysis of backtracking on random constraint satisfaction problems
-
Xu K., and Li W. An average analysis of backtracking on random constraint satisfaction problems. Ann. Math. Artif. Intell. 33 (2001) 21-37
-
(2001)
Ann. Math. Artif. Intell.
, vol.33
, pp. 21-37
-
-
Xu, K.1
Li, W.2
-
86
-
-
0042549190
-
-
Y. Zhang, A.K. Mackworth, Parallel and distributed algorithms for finite constraint satisfaction problems, in: Proceedings of the third IEEE Symposium on parallel distributed computing, Dallas, TX, 1991, pp. 394-397.
-
-
-
-
87
-
-
84880855556
-
-
Y. Zhang, R.Yap, Making AC-3 an optimal algorithm, in: Proceedings of 17th International Joint Conference on Artificial Intelligence, 2001, pp. 316-321.
-
-
-
|