English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/130231
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

Adding laziness in BnB-ADOPT+

AuthorsLee, Jimmy; Meseguer, Pedro ; Su, Wen
KeywordsNon-redundant
Experimental evidence
Small variations
Distributed constraint optimizations
Cost changes
Constrained optimization
Arc consistency
Issue Date2015
PublisherKluwer Academic Publishers
CitationConstraints 20: 274-282 (2015)
AbstractIn distributed constraint optimization, agents executing BnB-ADOPT+ react eagerly to cost changes: they send non-redundant COST messages to their parents as soon as they receive new messages. We have observed that a lazier reaction (not sending COST messages until a condition is met) substantially decrements the number of messages sent and causes only a small variation in ENCCCs. This approach combines nicely with soft arc consistency maintenance during search. We provide experimental evidence of the benefits of this approach on several benchmarks.
Publisher version (URL)http://doi.org/10.1007/s10601-014-9177-3
URIhttp://hdl.handle.net/10261/130231
DOI10.1007/s10601-014-9177-3
Identifiersissn: 1383-7133
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
CONST_20(274-82)2015.pdf111,92 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.