On the public citation graph

Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs

0 signed · 40 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/3-540-61551-2_70openalex-snapshot
Local search and the number of solutions
inferredcites →https://doi.org/10.1016/0004-3702(95)00044-5openalex-snapshot
Phase transitions and the search problem
inferredcites →https://doi.org/10.1016/0166-218x(94)90212-7openalex-snapshot
Local optima topology for the k-coloring problem
inferredcites →https://doi.org/10.1109/34.506412openalex-snapshot
Real-time bidirectional search: coordinated problem solving in uncertain situations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11591191_41openalex-snapshot
Another Complete Local Search Method for SAT
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_25openalex-snapshot
A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_51openalex-snapshot
Boosting Local Search with Artificial Ants
inferred← citeshttps://doi.org/10.1007/3-540-46033-0_16openalex-snapshot
SAT, Local Search Dynamics and Density of States
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_20openalex-snapshot
An Introduction to Fitness Landscape Analysis and Cost Models for Local Search
inferred← citeshttps://doi.org/10.1007/978-1-4757-4137-7_15openalex-snapshot
An Analysis of Solution Properties of the Graph Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_7openalex-snapshot
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition
inferred← citeshttps://doi.org/10.1007/978-3-319-40132-4_2openalex-snapshot
Local Search Algorithms for Portfolio Selection: Search Space and Correlation Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_9openalex-snapshot
Local Search on SAT-encoded Colouring Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78987-1_12openalex-snapshot
An Adaptive Metaheuristic for the Simultaneous Resolution of a Set of Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-03751-1_3openalex-snapshot
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03751-1_4openalex-snapshot
A Theoretical Analysis of the k-Satisfiability Search Space
inferred← citeshttps://doi.org/10.1007/s10472-004-9429-9openalex-snapshot
A SAT Approach to Query Optimization in Mediator Systems
inferred← citeshttps://doi.org/10.1007/s10664-006-7551-5openalex-snapshot
Simulated annealing applied to test generation: landscape characterization and stopping criteria
inferred← citeshttps://doi.org/10.1007/s10845-020-01587-wopenalex-snapshot
Metaheuristics for the template design problem: encoding, symmetry and hybridisation
inferred← citeshttps://doi.org/10.1007/s10951-009-0113-0openalex-snapshot
Understanding the behavior of Solution-Guided Search for job-shop scheduling
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00410-9openalex-snapshot
SAT problems with chains of dependent variables
inferred← citeshttps://doi.org/10.1023/a:1006350622830openalex-snapshot
Local Search Algorithms for SAT: An Empirical Evaluation
inferred← citeshttps://doi.org/10.1023/a:1021809724362openalex-snapshot
Negative Effects of Modeling Techniques on Search Performance
inferred← citeshttps://doi.org/10.1109/scis-isis.2012.6505301openalex-snapshot
A population based cunning ant system for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1109/taai.2010.58openalex-snapshot
Ant Population Meta-Heuristics for Binary Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/taai.2011.34openalex-snapshot
Solving Constraint Satisfaction Problems by ACO with Cunning Ants
inferred← citeshttps://doi.org/10.1109/tai.2000.889895openalex-snapshot
Local minimum structures of graph-coloring problems for stochastic constraint satisfaction algorithms
inferred← citeshttps://doi.org/10.1109/tevc.2002.802449openalex-snapshot
Ants can solve constraint satisfaction problems
inferred← citeshttps://doi.org/10.1134/s0361768826700258openalex-snapshot
Efficient Linear and Quadratic Approximation Models for the Cell Switch-Off Problem in Ultradense Networks
inferred← citeshttps://doi.org/10.1145/1160633.1160738openalex-snapshot
Solution sets for DCOPs and graphical games
inferred← citeshttps://doi.org/10.1145/1569901.1569952openalex-snapshot
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
inferred← citeshttps://doi.org/10.1145/2421636.2421639openalex-snapshot
Synthesis of tiled patterns using factor graphs
inferred← citeshttps://doi.org/10.1541/ieejeiss.125.1444openalex-snapshot
Finger Character Recognition Using 3-Dimensional Template Matching
inferred← citeshttps://doi.org/10.15439/2015f7openalex-snapshot
Hybrid Metaheuristic for Portfolio Selection: Comparison with an exact solver and search space analysis
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8142openalex-snapshot
Predicting Satisfiability at the Phase Transition
inferred← citeshttps://doi.org/10.1613/jair.2013openalex-snapshot
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
inferred← citeshttps://doi.org/10.1613/jair.711openalex-snapshot
Backbone Fragility and the Local Search Cost Peak
inferred← citeshttps://doi.org/10.25549/usctheses-m530openalex-snapshot
Local optimization in cooperative agent networks
inferred← citeshttps://doi.org/10.2964/jsik.16.1_15openalex-snapshot
Human Recognition with Ear Image by Principal Component Analysis
inferred← citeshttps://doi.org/10.2964/jsik_kj00001039536openalex-snapshot
Human Recognition with Ear Image by Principal Component Analysis
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.