Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

58.765 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Solving 'Still life' with soft constraints and bucket elimination

Thumbnail
View/Open
R03-14.ps (228,4Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/97372

Show full item record
Morancho Llena, EnriqueMés informacióMés informacióMés informació
Larrosa Bondia, Francisco JavierMés informacióMés informacióMés informació
Document typeResearch report
Defense date2003-04
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
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.
CitationMorancho, E., Larrosa, J. "Solving 'Still life' with soft constraints and bucket elimination". 2003. 
Is part ofLSI-03-14-R
URIhttp://hdl.handle.net/2117/97372
Collections
  • Departament d'Arquitectura de Computadors - Reports de recerca [176]
  • Departament de Ciències de la Computació - Reports de recerca [1.106]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
R03-14.ps228,4KbPostscriptView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina