Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Solving 'Still life' with soft constraints and bucket elimination

Autor
Morancho, E.; Larrosa, J.
Tipus d'activitat
Document cientificotècnic
Data
2003-04
Codi
LSI-03-14-R
Repositori
http://hdl.handle.net/2117/97372 Obrir en finestra nova
Resum
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 ...
Citació
Morancho, E., Larrosa, J. "Solving 'Still life' with soft constraints and bucket elimination". 2003.
Paraules clau
Bucket elimination, Software contraints, Still life
Grup de recerca
CAP - Grup de Computació d'Altes Prestacions
LOGPROG - Lògica i Programació

Arxius