A Generic Search Heuristic Based on Survey Propagation to Solve CSPs

Faculty Science Year: 2012
Type of Publication: ZU Hosted Pages:
Authors:
Mohammed Hamza Mahmoud Ibrahim
Journal: International Conference on Principal and Practice of Constraint Programming AAAI Press Volume:
Keywords : , Generic Search Heuristic Based , Survey Propagation    
Abstract:
Probabilistic message-passing algorithms have had some recent success as the basis for search heuristics to solve satisfaction problems. In particular, Expectation Maximization Survey Propagation (EMSP) has been used in the context of SAT a
    
     
 
       

Author Related Publications

  • Mohammed Hamza Mahmoud Ibrahim, "Improving Probabilistic Inference in Graphical Models with Determinism and Cycles", springer, 2016 More
  • Mohammed Hamza Mahmoud Ibrahim, "Log-odd: A New Method for Improving an HMM Decoding for Gene Finding", K. J. of science & engineering, 2012 More
  • Mohammed Hamza Mahmoud Ibrahim, "Improving the Performance of an HMM for Protein Family Modeling", Science Alert, 2007 More
  • Mohammed Hamza Mahmoud Ibrahim, "Exploiting Determinism to Scale Relational Inference", AAAI Press, 2015 More

Department Related Publications

  • Ahmed Abdelnaby Mohamed mohmd, "Construction of uniform designs via an adjusted threshold accepting algorithm", ScienceDirect, 2017 More
  • Yasser AbdelAziz Amer Tolba, "Passive vibration control for nonlinear Structural Modal of multiple-degree-of-freedom System", انجلترا, 2016 More
  • Reda Saleh Tantawy, "Fully differential cross sections for ionization of H(2s) atoms by proton and antiproton impact", Physica Scripta, 2015 More
  • Hassan Mostafa Metwally, "Granular Computing Biapproximation Spaces", IEEE, 2005 More
Tweet