Mostra el registre d'ítem simple
Look-ahead with mini-bucket heuristics for MPE
dc.contributor.author | Dechter, Rina |
dc.contributor.author | Kask, Kalev |
dc.contributor.author | Lam, William |
dc.contributor.author | Larrosa Bondia, Francisco Javier |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-12-01T11:47:58Z |
dc.date.available | 2016-12-01T11:47:58Z |
dc.date.issued | 2016 |
dc.identifier.citation | Dechter, R., Kask, K., Lam, W., Larrosa, J. Look-ahead with mini-bucket heuristics for MPE. A: AAAI Conference on Artificial Intelligence. "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16)". AAAI Press (Association for the Advancement of Artificial Intelligence), 2016, p. 694-701. |
dc.identifier.uri | http://hdl.handle.net/2117/97599 |
dc.description.abstract | The paper investigates the potential of look-ahead in the con-text of AND/OR search in graphical models using the Mini-Bucket heuristic for combinatorial optimization tasks (e.g., MAP/MPE or weighted CSPs). We present and analyze the complexity of computing the residual (a.k.a Bellman update) of the Mini-Bucket heuristic and show how this can be used to identify which parts of the search space are more likely to benefit from look-ahead and how to bound its overhead. We also rephrase the look-ahead computation as a graphical model, to facilitate structure exploiting inference schemes. We demonstrate empirically that augmenting Mini-Bucket heuristics by look-ahead is a cost-effective way of increasing the power of Branch-And-Bound search. |
dc.format.extent | 8 p. |
dc.language.iso | eng |
dc.publisher | AAAI Press (Association for the Advancement of Artificial Intelligence) |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Algorithms |
dc.subject.other | AND/OR search |
dc.subject.other | Graphical models |
dc.subject.other | Mini-Bucket heuristic |
dc.subject.other | Search algorithms |
dc.title | Look-ahead with mini-bucket heuristics for MPE |
dc.type | Conference lecture |
dc.subject.lemac | Algorismes |
dc.contributor.group | Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació |
dc.relation.publisherversion | http://www.aaai.org/Library/AAAI/aaai16contents.php |
dc.rights.access | Open Access |
local.identifier.drac | 19265439 |
dc.description.version | Postprint (published version) |
local.citation.author | Dechter, R.; Kask, K.; Lam, W.; Larrosa, J. |
local.citation.contributor | AAAI Conference on Artificial Intelligence |
local.citation.publicationName | Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16) |
local.citation.startingPage | 694 |
local.citation.endingPage | 701 |