Random Constraint Satisfaction a More Accurate Picture

No abstract is available for this paper.

• Publication year

  year unknown

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Combinatorics, Probability and Computing

  2020cited by this paper
• Almost all graphs with 2.522 n edges are not 3-colorable

  1999cited by this paper
• Approximating the unsatisfiability threshold of random formulas

  1998cited by this paper
• An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems

  1996cited by this paper
• Refining the Phase Transition in Combinatorial Search

  1996cited by this paper
• Analysis of Two Simple Heuristics on a Random Instance of k-SAT

  1996cited by this paper
• Locating the Phase Transition in Binary Constraint Satisfaction Problems

  1996cited by this paper
• Exploiting the Deep Structure of Constraint Problems

  1994cited by this paper
• Extending Deep Structure

  1993cited by this paper
• Using Deep Structure to Locate Hard Problems

  1992cited by this paper
• Mick gets some (the odds are on his side) (satisfiability)

  1992cited by this paper
• Where the Really Hard Problems Are

  1991cited by this paper
• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem

  1990cited by this paper
• Ten lectures on the probabilistic method

  1987cited by this paper
• Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem

  1986cited by this paper
• On the evolution of random graphs

  1984cited by this paper
• Understanding Line drawings of Scenes with Shadows

  1975cited by this paper

• Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length

  2022cites this paper
• A residual-based message passing algorithm for constraint satisfaction problems

  2022cites this paper
• The solution space structure of planted constraint satisfaction problems with growing domains

  2021cites this paper
• A new branch-and-filter exact algorithm for binary constraint satisfaction problems

  2021cites this paper
• Super solutions of the model RB

  2021cites this paper
• Phase Transition Behavior in Knowledge Compilation

  2020cites this paper
• A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems

  2020cites this paper
• Exact Phase Transitions of Model RB with Slower-Growing Domains

  2020cites this paper
• Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products

  2020cites this paper
• Reconstructing in the Constraint Satisfaction Problem

  2020cites this paper
• CSPLib: Twenty Years On

  2019cites this paper
• Hybrid Tractable Class for Quantified Constraint Satisfaction Problems

  2019cites this paper
• When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases

  2018cites this paper
• Balanced Random Constraint Satisfaction: Phase Transition and Hardness

  2018cites this paper
• Sharp Thresholds for a Random Constraint Satisfaction Problem

  2017cites this paper
• Complexity of n-Queens Completion

  2017cites this paper
• Problem Difficulty and the Phase Transition in Heuristic Search

  2017cites this paper
• Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems

  2016cites this paper
• The scaling window of the model d-k-CSP

  2016cites this paper
• A Neuro-evolutionary Hyper-heuristic Approach for Constraint Satisfaction Problems

  2016cites this paper
• A Model for Phase Transition of Random Answer-Set Programs

  2016cites this paper
• Grammar-based generation of variable-selection heuristics for constraint satisfaction problems

  2016influential citation
• Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems

  2016cites this paper
• Performances of pure random walk algorithms on constraint satisfaction problems with growing domains

  2015cites this paper
• Evolutionary Computation and Constraint Satisfaction

  2015cites this paper
• On the constraint length of random k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-CSP

  2014cites this paper
• A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains

  2014cites this paper
• An upper (lower) bound for Max (Min) CSP

  2014cites this paper
• Satisfiability Transition and Experiments on a Random Constraint Satisfaction Problem Model

  2014cites this paper
• Automatic Generation of Heuristics for Constraint Satisfaction Problems

  2013cites this paper
• Abstraction in Artificial Intelligence and Complex Systems

  2013cites this paper
• Foundations of CSP

  2013cites this paper
• Learning vector quantization for variable ordering in constraint satisfaction problems

  2013cites this paper
• Phase Transitions in Random Negative Two-Literal Logic Programs

  2013cites this paper
• A genetic programming hyper-heuristic: Turning features into heuristics for constraint satisfaction

  2013cites this paper
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT

  2012cites this paper
• The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem

  2012cites this paper
• A belief-propagation algorithm based on variable entropy for constraint satisfaction problems

  2012cites this paper
• A general model and thresholds for random constraint satisfaction problems

  2012cites this paper
• Improving the performance of vector hyper-heuristics through local search

  2012cites this paper
• Challenging heuristics: evolving binary constraint satisfaction problems

  2012cites this paper
• 2 Evolutionary Computation in Constraint Satisfaction

  2012cites this paper
• Using UML and OCL for representing multiobjective combinatorial optimization problems

  2012cites this paper
• Consistency and Random Constraint Satisfaction Models

  2011cites this paper
• A New General Method to Generate Random Modal Formulae for Testing Decision Procedures

  2011cites this paper
• On the phase transitions of random k-constraint satisfaction problems

  2011cites this paper
• A message-passing approach to random constraint satisfaction problems with growing domains

  2011cites this paper
• Evolutionary Computation in Constraint Satisfaction

  2010cites this paper
• Aggregation and constraint processing in lifted probabilistic inference

  2010cites this paper
• de satisfaction de contraintes et d'optimisation combinatoire

  2010cites this paper
• Report on the Workshop on Satisfiability : Assessing the Progress

  2010cites this paper
• Estimating satisfiability

  2010cites this paper
• Probabilistic Analysis of Satisfiability Algorithms

  2010cites this paper
• Constraint Logic Programming

  2010cites this paper
• Bounding the Phase Transition on Edge Matching Puzzles

  2009cites this paper
• A conflict based SAW method for Constraint Satisfaction Problems

  2009cites this paper
• CSP problems as algorithmic benchmarks: measures, methods and models

  2009cites this paper
• The SAT-UNSAT transition for random constraint satisfaction problems

  2009cites this paper
• Solving quantified constraint satisfaction problems

  2008cites this paper
• When does the giant component bring unsatisfiability?

  2008cites this paper
• Threshold Phenomena in Random Constraint Satisfaction Problems

  2008cites this paper
• From High Girth Graphs to Hard Instances

  2008cites this paper
• A Model to Study Phase Transition and Plateaus in Relational Learning

  2008cites this paper
• The Phase Transition Behaviour of Non-binary Forward Checking Algorithms

  2008cites this paper
• Consistency and the Quantified Constraint Satisfaction Problem

  2007influential citation
• Consistency and the quantified constraint satisfaction problem

  2007cites this paper
• Qualitative Spatial Reasoning Using Constraint Calculi

  2007cites this paper
• On Balanced CSPs with High Treewidth

  2007cites this paper
• Partition search for non-binary constraint satisfaction

  2007influential citation
• Random constraint satisfaction: Easy generation of hard (satisfiable) instances

  2007influential citation
• A History of Satisfiability

  2007cites this paper
• Dynamic backtracking for general CSPs.

  2007cites this paper
• MAX k-CUT and approximating the chromatic number of random graphs

  2006cites this paper
• Evolving Combinatorial Problem Instances That Are Difficult to Solve

  2006influential citation
• Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication. (Explanation-based algorithms in Constraint Programming)

  2006cites this paper
• GRASP - evolution for constraint satisfaction problems

  2006cites this paper
• Incorporating Inference into Evolutionary Algorithms for Max-CSP

  2006cites this paper
• Sharp thresholds for constraint satisfaction problems and homomorphisms

  2006cites this paper
• Randomness and Structure

  2006cites this paper
• An Extended Rcsp Generating Model and its Application

  2006influential citation
• Chapter 1 QUALITATIVE SPATIAL REASONING USING CONSTRAINT CALCULI

  2006cites this paper
• The satisfiability threshold for randomly generated binary constraint satisfaction problems

  2006cites this paper
• Résolution de problèmes combinatoires par des approches fondées sur la notion d'explication

  2006cites this paper
• A Simple Model to Generate Hard Satisfiable Instances

  2005cites this paper
• A Decomposition Technique for CSPs Using Maximal Independent Sets and Its Integration with Local Search

  2005influential citation
• Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?

  2005cites this paper
• Another look at the phenomenon of phase transition

  2005cites this paper
• Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population

  2005cites this paper
• Benders decomposition in Constraint Programming

  2005cites this paper
• Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire

  2005cites this paper
• Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming

  2005cites this paper
• Transition models as an incremental approach for problem solving in evolutionary algorithms

  2005cites this paper
• Description and Representation of the Problems selected for the First International Constraint Satisfaction Solver Competition

  2005cites this paper
• Exploiting phase transitions for fusion optimization problems

  2005cites this paper
• Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

  2005cites this paper
• When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems

  2005cites this paper
• Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications

  2005cites this paper
• Contributions à la résolution pratique de problèmes combinatoires: des fourmis et des graphes

  2005cites this paper
• Another look at the phenomenon of phase transition

  2005cites this paper
• Solving constraint satisfaction problems with evolutionary algorithms

  2005cites this paper