Matches in SemOpenAlex for { <https://semopenalex.org/work/W2023663308> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W2023663308 endingPage "210" @default.
- W2023663308 startingPage "201" @default.
- W2023663308 abstract "In this paper, we discuss variable and value symmetries in distributed constraint reasoning and efficient methods to represent and propagate them in distributed environments. Unlike commonly used centralised methods which detect symmetries according to their global definition, we suggest here to define them at the individual constraint level, then define operations on those symmetries in order to propagate them through the depth-first search tree that is generated in efficient distributed constraint reasoning algorithms. In our algorithm, we represent constraints (or utility functions) by a list of costs: while the usual representation lists one cost for one assignation, we drastically reduce the size of that list by keeping only one cost for one class of equivalence of assignations. In practice, for a constraint with n symmetric variables defined on a domain of n symmetric values, this approach cuts down the size of the list of costs from nn to p(n) (partition function of n), i.e., from 1010 to 42 when n = 10. We henceforth devised algorithms to process the sparse representations of utility functions and to propagate them along with symmetry information among distributed agents. We implemented this new representation of constraints and tested it with the DPOP algorithm on distributed graph colouring problems, rich in symmetries. Our evaluation shows that in 19% of execution instances we cut down 10 times the volume of communication spent, while no significant overhead appears in non symmetrical executions. These results open serious perspectives on a possible bounding of memory and communication bandwidth consumption in some subclass of distributed constraint reasoning problems." @default.
- W2023663308 created "2016-06-24" @default.
- W2023663308 creator A5037726021 @default.
- W2023663308 creator A5056038063 @default.
- W2023663308 date "2011-01-01" @default.
- W2023663308 modified "2023-10-18" @default.
- W2023663308 title "Efficient Representation of Constraints and Propagation of Variable-Value Symmetries in Distributed Constraint Reasoning" @default.
- W2023663308 cites W1527987966 @default.
- W2023663308 cites W1548955532 @default.
- W2023663308 cites W1556129273 @default.
- W2023663308 cites W186587644 @default.
- W2023663308 cites W1982333717 @default.
- W2023663308 cites W2015918917 @default.
- W2023663308 cites W2016578044 @default.
- W2023663308 cites W2033546932 @default.
- W2023663308 cites W2110116921 @default.
- W2023663308 cites W2128040438 @default.
- W2023663308 cites W2158896662 @default.
- W2023663308 cites W2171737120 @default.
- W2023663308 doi "https://doi.org/10.2197/ipsjjip.19.201" @default.
- W2023663308 hasPublicationYear "2011" @default.
- W2023663308 type Work @default.
- W2023663308 sameAs 2023663308 @default.
- W2023663308 citedByCount "0" @default.
- W2023663308 crossrefType "journal-article" @default.
- W2023663308 hasAuthorship W2023663308A5037726021 @default.
- W2023663308 hasAuthorship W2023663308A5056038063 @default.
- W2023663308 hasBestOaLocation W20236633081 @default.
- W2023663308 hasConcept C11413529 @default.
- W2023663308 hasConcept C120314980 @default.
- W2023663308 hasConcept C130120984 @default.
- W2023663308 hasConcept C137105694 @default.
- W2023663308 hasConcept C154945302 @default.
- W2023663308 hasConcept C178481205 @default.
- W2023663308 hasConcept C199360897 @default.
- W2023663308 hasConcept C199622910 @default.
- W2023663308 hasConcept C2524010 @default.
- W2023663308 hasConcept C2776036281 @default.
- W2023663308 hasConcept C2779960059 @default.
- W2023663308 hasConcept C33923547 @default.
- W2023663308 hasConcept C41008148 @default.
- W2023663308 hasConcept C49937458 @default.
- W2023663308 hasConcept C63584917 @default.
- W2023663308 hasConcept C80444323 @default.
- W2023663308 hasConcept C96469262 @default.
- W2023663308 hasConceptScore W2023663308C11413529 @default.
- W2023663308 hasConceptScore W2023663308C120314980 @default.
- W2023663308 hasConceptScore W2023663308C130120984 @default.
- W2023663308 hasConceptScore W2023663308C137105694 @default.
- W2023663308 hasConceptScore W2023663308C154945302 @default.
- W2023663308 hasConceptScore W2023663308C178481205 @default.
- W2023663308 hasConceptScore W2023663308C199360897 @default.
- W2023663308 hasConceptScore W2023663308C199622910 @default.
- W2023663308 hasConceptScore W2023663308C2524010 @default.
- W2023663308 hasConceptScore W2023663308C2776036281 @default.
- W2023663308 hasConceptScore W2023663308C2779960059 @default.
- W2023663308 hasConceptScore W2023663308C33923547 @default.
- W2023663308 hasConceptScore W2023663308C41008148 @default.
- W2023663308 hasConceptScore W2023663308C49937458 @default.
- W2023663308 hasConceptScore W2023663308C63584917 @default.
- W2023663308 hasConceptScore W2023663308C80444323 @default.
- W2023663308 hasConceptScore W2023663308C96469262 @default.
- W2023663308 hasLocation W20236633081 @default.
- W2023663308 hasOpenAccess W2023663308 @default.
- W2023663308 hasPrimaryLocation W20236633081 @default.
- W2023663308 hasRelatedWork W115413730 @default.
- W2023663308 hasRelatedWork W1486916474 @default.
- W2023663308 hasRelatedWork W1552940002 @default.
- W2023663308 hasRelatedWork W2012141606 @default.
- W2023663308 hasRelatedWork W206304267 @default.
- W2023663308 hasRelatedWork W2140769824 @default.
- W2023663308 hasRelatedWork W2144427074 @default.
- W2023663308 hasRelatedWork W2162117398 @default.
- W2023663308 hasRelatedWork W2784687883 @default.
- W2023663308 hasRelatedWork W2137855809 @default.
- W2023663308 hasVolume "19" @default.
- W2023663308 isParatext "false" @default.
- W2023663308 isRetracted "false" @default.
- W2023663308 magId "2023663308" @default.
- W2023663308 workType "article" @default.