Pages that link to "Item:Q689615"
From MaRDI portal
The following pages link to Optimal speedup of Las Vegas algorithms (Q689615):
Displaying 50 items.
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
- SAT race 2015 (Q334795) (← links)
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- On algorithm portfolios and restart strategies (Q631216) (← links)
- Restart strategies in optimization: parallel and serial cases (Q632718) (← links)
- Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- Restart strategies in a continuous setting (Q825972) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- Learning dynamic algorithm portfolios (Q870809) (← links)
- Parallel and distributed local search in COMET (Q1010289) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Using constraint programming for solving RCPSP/MAX-cal (Q1699524) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- Hitting times in Markov chains with restart and their application to network centrality (Q1739335) (← links)
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems (Q1754108) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
- Stochastic optimization with adaptive restart: a framework for integrated local and global learning (Q2022223) (← links)
- Limit theorems for the one-dimensional random walk with random resetting to the maximum (Q2038946) (← links)
- New records of pre-image search of reduced SHA-1 using SAT solvers (Q2079908) (← links)
- Ant colony optimization for path planning in search and rescue operations (Q2083926) (← links)
- Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding (Q2117205) (← links)
- Short-term scheduling of production fleets in underground mines using CP-based LNS (Q2117237) (← links)
- Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
- On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
- BoostingTree: parallel selection of weak learners in boosting, with application to ranking (Q2251442) (← links)
- Variable neighborhood search for graphical model energy minimization (Q2287189) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- Combinatorial search from an energy perspective (Q2419800) (← links)
- A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- The state of SAT (Q2643296) (← links)
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
- (Q2741540) (← links)
- An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
- A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
- Extreme Cases in SAT Problems (Q2818004) (← links)
- Anytime Computation of Cautious Consequences in Answer Set Programming (Q2931278) (← links)
- Between Restarts and Backjumps (Q3007685) (← links)
- Empirical Study of the Anatomy of Modern Sat Solvers (Q3007695) (← links)
- Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly (Q3092339) (← links)
- Promise Problems on Probability Distributions (Q3297824) (← links)
- Resetting with stochastic return through linear confining potential (Q4992332) (← links)
- Diffusion processes with Gamma-distributed resetting and non-instantaneous returns (Q5048525) (← links)
