scientific article
From MaRDI portal
Publication:4012213
zbMath0747.68065MaRDI QIDQ4012213
Shmuel Katz, Zeev Collin, Rina Dechter
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
constraint satisfaction problemsconnectionist architecturesnetwork consistency problemnetwork-consistency protocol
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)
Related Items
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems ⋮ Hierarchical fault diagnosis for discrete-event systems under global consistency ⋮ Structure-driven algorithms for truth maintenance ⋮ Nogood-based asynchronous forward checking algorithms ⋮ Asynchronous aggregation and consistency in distributed constraint satisfaction ⋮ Adopt: asynchronous distributed constraint optimization with quality guarantees ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Solving CSPs with Naming Games ⋮ AND/OR search spaces for graphical models ⋮ Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts ⋮ AND/OR branch-and-bound search for combinatorial optimization in graphical models ⋮ Self-stabilizing depth-first search
