Switch to: Citations

Add references

You must login to add references.
  1. Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu, Frédéric Boussemart, Fred Hemery & Christophe Lecoutre - 2007 - Artificial Intelligence 171 (8-9):514-534.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Local search for Boolean Satisfiability with configuration checking and subscore.Shaowei Cai & Kaile Su - 2013 - Artificial Intelligence 204 (C):75-98.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Local search with edge weighting and configuration checking heuristics for minimum vertex cover.Shaowei Cai, Kaile Su & Abdul Sattar - 2011 - Artificial Intelligence 175 (9-10):1672-1696.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Probably bounded suboptimal heuristic search.Roni Stern, Gal Dreiman & Richard Valenzano - 2019 - Artificial Intelligence 267 (C):39-57.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6d5f778f9-cxrlj uwo