The following pages link to UBCSAT (Q15153):
Displaying 36 items.
- New local search methods for partial MaxSAT (Q329035) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Improved haplotype assembly using Xor genotypes (Q1784030) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT (Q3007692) (← links)
- Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches (Q3064530) (← links)
- Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT (Q3172891) (← links)
- Decomposing SAT Instances with Pseudo Backbones (Q3304190) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)
- Variable Dependency in Local Search: Prevention Is Better Than Cure (Q3612460) (← links)
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT (Q3612461) (← links)
- (Q3624109) (← links)
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT (Q3631249) (← links)
- Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem (Q3651486) (← links)
- ParamILS: An Automatic Algorithm Configuration Framework (Q3651487) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT (Q4930595) (← links)
- Green-Tao Numbers and SAT (Q4930604) (← links)
- Pitfalls and Best Practices in Algorithm Configuration (Q5376630) (← links)
- (Q5404310) (← links)
- Symmetry Breaking and Local Search Spaces (Q5450938) (← links)
- Justification-Based Local Search with Adaptive Noise Strategies (Q5505541) (← links)
- Theory and Applications of Satisfiability Testing (Q5713711) (← links)
- Theory and Applications of Satisfiability Testing (Q5714765) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900310) (← links)
