Random walk with continuously smoothed variable weights

DOI10.1007/11499107_15MaRDI QIDQ5713711zbMATH OpenOpenAlexFDO

Authors Steven Prestwich

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Clause weighting local search for SAT
• scientific article; zbMATH DE number 956863
• Neighbourhood Clause Weight Redistribution in Local Search for SAT
• Local search algorithms for SAT: an empirical evaluation
• scientific article; zbMATH DE number 5510694

Cited in

(11)

• SATenstein: automatically building local search SAT solvers from components
• MaxSAT by improved instance-specific algorithm configuration
• Captain Jack: new variable selection heuristics in local search for SAT
• A switching criterion for intensification and diversification in local search for SAT
• Towards fewer parameters for SAT clause weighting algorithms
• AI 2003: Advances in Artificial Intelligence
• Diversification and determinism in local search for satisfiability
• AI 2005: Advances in Artificial Intelligence
• Meta-heuristics and artificial intelligence
• Clause weighting local search for SAT
• Boosting haplotype inference with local search

Describes a project that uses

Uses Software

• Walksat
• SATO
• Chaff
• BerkMin
• BG-WalkSAT
• UBCSAT

This page was built for publication: Random walk with continuously smoothed variable weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713711)