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.848 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.

Partial lazy forward checking

Thumbnail
View/Open
R97-54.pdf (111,4Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/84409

Show full item record
Larrosa Bondia, Francisco JavierMés informacióMés informacióMés informació
Meseguer González, Pedro
Document typeResearch report
Defense date1997-11
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
Partial forward checking (PFC) may perform more consistency checks than really needed to detect dead-ends in MAX-CSP. After analyzing PFC, we have identified four causes of redundant check computation: (a) unnecessary lookahead when detecting an empty domain, (b) not always using the better bounds for future value pruning, (c) computing in advance inconsistency counts, and (d) lookahead is performed on the whole set of future variables. We present the partial lazy forward checking (PLFC) algorithm, which follows a lazy approach delaying as much as possible inconsistency count computation, keeping updated the contribution of future variables to the lower bound. This algorithm avoids the causes of redundant checks identified for PFC. It can be easily combined with DACs, producing the PLFC-DAC algorithm. Empirical results on random problems show that PLFC-DAC outperforms previous algorithms in both consistency checks and CPU time.
CitationLarrosa, J., Meseguer, P. "Partial lazy forward checking". 1997. 
Is part ofR97-54
URIhttp://hdl.handle.net/2117/84409
Collections
  • Departament de Ciències de la Computació - Reports de recerca [1.106]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
R97-54.pdf111,4KbPDFView/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