Pages that link to "Item:Q1977752"
From MaRDI portal
The following pages link to Heavy-tailed phenomena in satisfiability and constraint satisfaction problems (Q1977752):
Displaying 50 items.
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- Promoting robust black-box solvers through competitions (Q606901) (← links)
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning (Q647446) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- The impact of search heuristics on heavy-tailed behaviour (Q850467) (← links)
- Applying SAT solving in classification of finite algebras (Q862393) (← links)
- Improved strategies for radial basis function methods for global optimization (Q868637) (← links)
- Learning dynamic algorithm portfolios (Q870809) (← links)
- Parallel and distributed local search in COMET (Q1010289) (← links)
- A generative power-law search tree model (Q1010292) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- Progress towards the Holy Grail (Q1616388) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
- Vampire getting noisy: Will random bits help conquer chaos? (system description) (Q2104552) (← links)
- Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding (Q2117205) (← links)
- Lightweight dynamic symmetry breaking (Q2342593) (← links)
- Combinatorial search from an energy perspective (Q2419800) (← links)
- Randomised restarted search in ILP (Q2433174) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- Enhancing stochastic search performance by value-biased randomization of heuristics (Q2573000) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- The state of SAT (Q2643296) (← links)
- (Q2741533) (← links)
- (Q2741540) (← links)
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers (Q2964456) (← links)
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT (Q3453235) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
- On Universal Restart Strategies for Backtracking Search (Q3523083) (← links)
- Hierarchical Hardness Models for SAT (Q3523084) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)
- A Generator of Heavy-Tailed Search Trees (Q4644977) (← links)
- Estimation of the maximal moment exponent with censored data (Q4787647) (← links)
- Optimizing Noisy Complex Systems Liable to Failure (Q5024349) (← links)
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
- Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks (Q5157180) (← links)
