Pages that link to "Item:Q1383842"

The following pages link to A discrete Lagrangian-based global-search method for solving satisfiability problems (Q1383842):

Displaying 17 items.

• Practical optimization of group piles using discrete Lagrange multiplier method (Q535710) (← links)
• Clause weighting local search for SAT (Q862404) (← links)
• Experimental complexity analysis of continuous constraint satisfaction problems. (Q1425278) (← links)
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
• A Lagrangian reconstruction of GENET (Q1589464) (← links)
• Automatically improving constraint models in Savile Row (Q1680696) (← links)
• A SAT approach to query optimization in mediator systems (Q1777403) (← links)
• Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization (Q1977849) (← links)
• Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient (Q2045943) (← links)
• A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization (Q2193277) (← links)
• Timescales of Boolean satisfiability solver using continuous-time dynamical system (Q2204452) (← links)
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
• Constraint partitioning in penalty formulations for solving temporal planning problems (Q2457638) (← links)
• The distributed breakout algorithms (Q2457700) (← links)
• Solving SAT problem by heuristic polarity decision-making algorithm (Q2465749) (← links)
• The state of SAT (Q2643296) (← links)
• Local search characteristics of incomplete SAT procedures (Q5958635) (← links)