On the public citation graph

Random Walk with Continuously Smoothed Variable Weights

0 signed · 64 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11527695_24openalex-snapshot
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
inferredcites →https://doi.org/10.1007/3-540-36187-1openalex-snapshot
AI 2002: Advances in Artificial Intelligence
inferredcites →https://doi.org/10.1007/3-540-36187-1_50openalex-snapshot
Towards Fewer Parameters for SAT Clause Weighting Algorithms
inferredcites →https://doi.org/10.1007/3-540-44886-1_12openalex-snapshot
Iterated Robust Tabu Search for MAX-SAT
inferredcites →https://doi.org/10.1007/3-540-44886-1_13openalex-snapshot
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
inferredcites →https://doi.org/10.1007/3-540-45578-7openalex-snapshot
Principles and practice of constraint programming - CP 2001 : 7th International Conference, CP 2001, Paphos, Cyprus, November 26-December 1, 2001 : proceedings
inferredcites →https://doi.org/10.1007/3-540-45578-7_48openalex-snapshot
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
inferredcites →https://doi.org/10.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferredcites →https://doi.org/10.1007/3-540-46135-3_15openalex-snapshot
Accelerating Random Walks
inferredcites →https://doi.org/10.1007/3-540-46135-3_16openalex-snapshot
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
inferredcites →https://doi.org/10.1007/bf02947312openalex-snapshot
An algorithm based on tabu search for satisfiability problem
inferredcites →https://doi.org/10.1016/s0166-218x(02)00410-9openalex-snapshot
SAT problems with chains of dependent variables
inferredcites →https://doi.org/10.1023/a:1006343127545openalex-snapshot
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
inferredcites →https://doi.org/10.1023/a:1018999721141openalex-snapshot
Boosting complete techniques thanks to local search methods
inferredcites →https://doi.org/10.1023/b:anor.0000032570.90510.8fopenalex-snapshot
Incomplete Dynamic Backtracking for Linear Pseudo-Boolean Problems
inferredcites →https://doi.org/10.1090/dimacs/026/18openalex-snapshot
Random generation of test instances with controlled attributes
inferredcites →https://doi.org/10.1145/130836.130837openalex-snapshot
Efficient local search for very large-scale satisfiability problems
inferredcites →https://doi.org/10.21236/ada273552openalex-snapshot
Discrete Applied Mathematics

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-030-06167-8_2openalex-snapshot
Meta-heuristics and Artificial Intelligence
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-11230-5openalex-snapshot
Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_10openalex-snapshot
Improving Cluster-Based Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_11openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_2openalex-snapshot
Related Work
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_3openalex-snapshot
Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_4openalex-snapshot
Training Parameterized Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_5openalex-snapshot
ISAC for Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_7openalex-snapshot
Training Parallel Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_8openalex-snapshot
Dynamic Approach for Switching Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_9openalex-snapshot
Evolving Instance-Specific Algorithm Configuration
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-319-56994-9_26openalex-snapshot
Enhanced WalkSAT with Variable Neighborhood Search for MAX-SAT Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_15openalex-snapshot
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_21openalex-snapshot
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-92695-5_15openalex-snapshot
Tuning Local Search by Average-Reward Reinforcement Learning
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-21581-0_24openalex-snapshot
Captain Jack: New Variable Selection Heuristics in Local Search for SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-35101-3_19openalex-snapshot
A Method to Avoid Duplicative Flipping in Local Search for SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-37198-1_14openalex-snapshot
From Sequential to Parallel Local Search for SAT
inferred← citeshttps://doi.org/10.1007/s10601-007-9035-7openalex-snapshot
Boosting Haplotype Inference with Local Search
inferred← citeshttps://doi.org/10.1007/s42979-021-00476-0openalex-snapshot
An Efficient Local Search SAT Solver with Effective Preprocessing for Structured Instances
inferred← citeshttps://doi.org/10.1016/j.artint.2015.11.002openalex-snapshot
SATenstein: Automatically building local search SAT solvers from components
inferred← citeshttps://doi.org/10.1016/j.artint.2015.12.006openalex-snapshot
MaxSAT by improved instance-specific algorithm configuration
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.1016/j.engappai.2010.01.009openalex-snapshot
Combining finite learning automata with GSAT for the satisfiability problem
inferred← citeshttps://doi.org/10.1080/00207540600621060openalex-snapshot
Template design under demand uncertainty by integer linear local search
inferred← citeshttps://doi.org/10.1109/iciev.2019.8858519openalex-snapshot
Implementing an Efficient SAT Solver for Structured Instances
inferred← citeshttps://doi.org/10.1155/2014/798323openalex-snapshot
A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems
inferred← citeshttps://doi.org/10.1162/evco_a_00078openalex-snapshot
A Multilevel Memetic Algorithm for Large SAT-Encoded Problems
inferred← citeshttps://doi.org/10.14288/1.0051500openalex-snapshot
SATenstein : automatically building local search SAT solvers from components
inferred← citeshttps://doi.org/10.1504/ijor.2013.054970openalex-snapshot
A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
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.v29i1.9372openalex-snapshot
Stochastic Local Search for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1613/jair.4480openalex-snapshot
Scoring Functions Based on Second Level Score for k-SAT with Long Clauses
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-300openalex-snapshot
A Study of Local Minimum Avoidance Heuristics for SAT
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.3233/sat190013openalex-snapshot
Preface to the Special Volume on the SAT 2005 Competitions and Evaluations
inferred← citeshttps://doi.org/10.3233/sat190045openalex-snapshot
A Switching Criterion for Intensification and Diversification in Local Search for SAT12
inferred← citeshttps://doi.org/10.4018/978-1-4666-0270-0.ch017openalex-snapshot
Stochastic Learning for SAT- Encoded Graph Coloring Problems
inferred← citeshttps://doi.org/10.4018/jamc.2010070101openalex-snapshot
Stochastic Learning for SAT- Encoded Graph Coloring Problems
inferred← citeshttps://doi.org/10.5121/ijaia.2012.3607openalex-snapshot
Single Vs Hierarchical Population-Based Memetic Algorithm for Sat-Encoded Industrial Problems:A Statistical Comparison
inferred← citeshttps://doi.org/10.5772/33436openalex-snapshot
A Multilevel Approach Applied to Sat-Encoded Problems
inferred← citeshttps://doi.org/10.70675/ad08458dz4a44z4650z96e6z23548486e2a7openalex-snapshot
Behavior recognition on noisy data-streams constrained by complex prior knowledge
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.