Solving CSPs with Naming Games (Q5191404): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Self-stabilizing systems in spite of distributed control / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4012213 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp transition towards shared vocabularies in multi-agent systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sur le coloriage des graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A graph coloring algorithm for large scheduling problems / rank | |||
Normal rank | |||
Latest revision as of 21:21, 1 July 2024
scientific article; zbMATH DE number 5590887
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving CSPs with Naming Games |
scientific article; zbMATH DE number 5590887 |
Statements
Solving CSPs with Naming Games (English)
0 references
6 August 2009
0 references
