An information-based neural approach to generic constraint satisfaction.

DOI10.1016/S0004-3702(02)00291-6zbMath1043.68086OpenAlexW2035294466MaRDI QIDQ1852859

Bo Söderberg, Henrik Jönsson

Publication date: 21 January 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00291-6

zbMATH Keywords

InformationConstraint satisfactionGraph coloringHeuristicArtificial neural networkConnectionistMean-field annealing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Some experiments with simulated annealing for coloring graphs
• ``Neural computation of decisions in optimization problems
• Phase transitions and the search problem
• An Information-Based Neural Approach to Constraint Satisfaction
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• New methods to color the vertices of a graph
• Determining computational complexity from characteristic ‘phase transitions’

This page was built for publication: An information-based neural approach to generic constraint satisfaction.