The following pages link to (Q4012216):
Displaying 50 items.
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study (Q293254) (← links)
- A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Upper-bounding the \(k\)-colorability threshold by counting covers (Q396853) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979) (← links)
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy (Q420791) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← links)
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class (Q679419) (← links)
- On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- Generic properties of a computational task predict human effort and performance (Q825138) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Cardinal: a finite sets constraint solver (Q879977) (← links)
- An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
- The asymptotic \(k\)-SAT threshold (Q900872) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
- On the connection between the phase transition of the covering test and the learning success rate in ILP (Q1009240) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869) (← links)
- Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552) (← links)
- Remote Agent: to boldly go where no AI system has gone before (Q1274747) (← links)
- A complete anytime algorithm for number partitioning (Q1277696) (← links)
- The computational complexity of propositional STRIPS planning (Q1337679) (← links)
- The hardest constraint problems: A double phase transition (Q1337687) (← links)
- Downward refinement and the efficiency of hierarchical problem solving (Q1341665) (← links)
- Exploiting the deep structure of constraint problems (Q1342216) (← links)
- Easy problems are sometimes hard (Q1342226) (← links)
- The TSP phase transition (Q1391912) (← links)
- Processing disjunctions in temporal constraint networks (Q1402717) (← links)
- SAT problems with chains of dependent variables (Q1408386) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Search algorithms in type theory (Q1575934) (← links)
- Algorithmic approach to the satisfactory graph partitioning problem (Q1580976) (← links)
- Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Generalized probabilistic satisfiability (Q1744442) (← links)
