Solving 'Still life' with soft constraints and bucket elimination
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, p...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2003 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97372 |
| Acceso en línea: | https://hdl.handle.net/2117/97372 |
| Access Level: | acceso abierto |
| Palabra clave: | Still life Software contraints Bucket elimination Àrees temàtiques de la UPC::Informàtica |
| Sumario: | 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. |
|---|