On the public citation graph
A Switching Criterion for Intensification and Diversification in Local Search for SAT12
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9780470612309.ch14openalex-snapshot
Combining Adaptive Noise and Look‐Ahead in Local Search for SAT
inferredcites →https://doi.org/10.1007/11499107_12openalex-snapshot
Diversification and Determinism in Local Search for Satisfiability
inferredcites →https://doi.org/10.1007/11499107_15openalex-snapshot
Random Walk with Continuously Smoothed Variable Weights
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_5openalex-snapshot
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_15openalex-snapshot
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
inferredcites →https://doi.org/10.1007/s10472-004-9421-4openalex-snapshot
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
inferredcites →https://doi.org/10.1016/s0004-3702(01)00151-5openalex-snapshot
Local search characteristics of incomplete SAT procedures
inferredcites →https://doi.org/10.5555/777092.777193openalex-snapshot
An adaptive noise mechanism for walkSAT
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-03680-9_18openalex-snapshot
Diversify Intensification Phases in Local Search for SAT with a New Probability Distribution
inferred← citeshttps://doi.org/10.1007/978-3-319-50349-3_14openalex-snapshot
Quantifying the Similarity of Algorithm Configurations
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_33openalex-snapshot
Problem-Sensitive Restart Heuristics for the DPLL Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_23openalex-snapshot
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_22openalex-snapshot
Diversification and Intensification in Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-41482-4_4openalex-snapshot
Parallel Local Search for Satisfiability
inferred← citeshttps://doi.org/10.1007/s10458-019-09419-9openalex-snapshot
Expertise drift in referral networks
inferred← citeshttps://doi.org/10.1007/s11432-016-0258-4openalex-snapshot
A randomized diversification strategy for solving satisfiability problem with long clauses
inferred← citeshttps://doi.org/10.1016/j.asoc.2012.01.013openalex-snapshot
Adaptive memory-based local search for MAX-SAT
inferred← citeshttps://doi.org/10.1109/ictai.2011.18openalex-snapshot
Local Search with Configuration Checking for SAT
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8149openalex-snapshot
Trap Avoidance in Local Search Using Pseudo-Conflict Learning
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25529openalex-snapshot
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers
inferred← citeshttps://doi.org/10.3233/978-1-61499-330-8-85openalex-snapshot
Trap escape for local search by backtracking and conflict reverse
inferred← citeshttps://doi.org/10.3390/sym11091145openalex-snapshot
On the Effectiveness of Using Elitist Genetic Algorithm in Mutation Testing
inferred← citeshttps://doi.org/10.7939/r3n010080openalex-snapshot
Improving Local Search for Resource-Constrained Planning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.