Mostra el registre d'ítem simple
Solving 'Still life' with soft constraints and bucket elimination
dc.contributor.author | Morancho Llena, Enrique |
dc.contributor.author | Larrosa Bondia, Francisco Javier |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-11-29T08:46:31Z |
dc.date.available | 2016-11-29T08:46:31Z |
dc.date.issued | 2003-04 |
dc.identifier.citation | Morancho, E., Larrosa, J. "Solving 'Still life' with soft constraints and bucket elimination". 2003. |
dc.identifier.uri | http://hdl.handle.net/2117/97372 |
dc.description.abstract | In this paper we study the aplicability of bucket elimination (BE) to the problem of finding stilllife patterns. Very recently, it has been tackled using integer programming and constraint programming, both of them being search-based methods. We show that BE, which is based on dynamic programming, provides an exponentially lower worstcase complexity than search methods. Then, we empirically show that BE is quite competitive with search-based approaches. Finally, we show how BE can be adapted to exploit the problem symmetries, with which in several cases we outperform previous results. |
dc.format.extent | 6 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-03-14-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | Still life |
dc.subject.other | Software contraints |
dc.subject.other | Bucket elimination |
dc.title | Solving 'Still life' with soft constraints and bucket elimination |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1873610 |
dc.description.version | Postprint (published version) |
local.citation.author | Morancho, E.; Larrosa, J. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [181]
-
Reports de recerca [1.107]