First Page | Document Content | |
---|---|---|
![]() Date: 2007-05-26 07:27:01Constraint programming Logic in computer science Combinatorial optimization Heuristics Operations research Guided Local Search WalkSAT Local search Maximum satisfiability problem Theoretical computer science Mathematics Applied mathematics | Source URL: www.bracil.netDownload Document from Source WebsiteFile Size: 203,43 KBShare Document on Facebook |
![]() | Lifting WALKSAT-based Local Search Algorithms for MAP Inference Somdeb Sarkhel Vibhav Gogate Computer Science DepartmentDocID: 1lY6L - View Document |
![]() | Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS ∗ Feng NiuDocID: 1lIIh - View Document |
![]() | On smoothed k-CNF formulas and the Walksat algorithm Amin Coja-Oghlan ∗DocID: 1bVio - View Document |
![]() | Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT Hai Leong Chieu Wee Sun Lee Singapore MIT AllianceDocID: 18YUm - View Document |
![]() | Artificial Intelligence–150 Local search characteristics of incomplete SAT procedures ✩ Dale Schuurmans ∗ , Finnegan Southey Department of Computer Science, University of Waterloo, Waterloo, ON N2LDocID: 13B5H - View Document |