The following pages link to Peter J. Stuckey (Q264991):
Displayed 50 items.
- Propagation via lazy clause generation (Q2272160) (← links)
- Wombit: a portfolio bit-vector solver using word-level propagation (Q2323450) (← links)
- Constraint programming for dynamic symbolic execution of JavaScript (Q2327235) (← links)
- Core-boosted linear search for incomplete MaxSAT (Q2327238) (← links)
- Local rapid learning for integer programs (Q2327240) (← links)
- Time table edge finding with energy variables (Q2327290) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- Explaining circuit propagation (Q2342589) (← links)
- Symmetries, almost symmetries, and lazy clause generation (Q2342601) (← links)
- Dominance breaking constraints (Q2342647) (← links)
- MiniZinc with strings (Q2409726) (← links)
- Dantzig-Wolfe decomposition and branch-and-price solving in G12 (Q2430361) (← links)
- Solving RCPSP/max by lazy clause generation (Q2434317) (← links)
- New integer linear programming approaches for course timetabling (Q2468480) (← links)
- Auditing Hamiltonian elections (Q2670846) (← links)
- (Q2729855) (← links)
- (Q2763645) (← links)
- (Q2767146) (← links)
- An Abstract Domain of Uninterpreted Functions (Q2796038) (← links)
- On CNF Encodings of Decision Diagrams (Q2815090) (← links)
- Lagrangian Decomposition via Sub-problem Search (Q2815096) (← links)
- Weighted Spanning Tree Constraint with Explanations (Q2815098) (← links)
- Parallelizing Constraint Programming with Learning (Q2815101) (← links)
- Rail Capacity Modelling with Constraint Programming (Q2815104) (← links)
- A Bit-Vector Solver with Word-Level Propagation (Q2815126) (← links)
- An Introduction to Search Combinators (Q2848892) (← links)
- (Q2863874) (← links)
- Efficient Intelligent Backtracking Using Linear Programming (Q2884543) (← links)
- Dynamic Programming to Minimize the Maximum Number of Open Stacks (Q2892372) (← links)
- Incremental Satisfiability and Implication for UTVPI Constraints (Q2899084) (← links)
- Solving Talent Scheduling with Dynamic Programming (Q2899107) (← links)
- (Q2909151) (← links)
- A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines (Q2940058) (← links)
- Exception analysis for non-strict languages (Q2949196) (← links)
- A theory of overloading (Q2949203) (← links)
- Analyzing Array Manipulating Programs by Program Transformation (Q2949696) (← links)
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (Q3007689) (← links)
- Optimal k-Level Planarization and Crossing Minimization (Q3073676) (← links)
- Optimizing bottom-up evaluation of constraint queries (Q3128615) (← links)
- (Q3181647) (← links)
- NP-Completeness of Minimal Width Unordered Tree Layout (Q3378499) (← links)
- Understanding functional dependencies via constraint handling rules (Q3419813) (← links)
- Improving PARMA trailing (Q3422415) (← links)
- A Framework for Extended Algebraic Data Types (Q3434624) (← links)
- $$\#\exists $$ SAT: Projected Model Counting (Q3453218) (← links)
- Automatic Minimal-Height Table Layout (Q3458745) (← links)
- Encodings of the Sequence Constraint (Q3523058) (← links)
- Propagation = Lazy Clause Generation (Q3523077) (← links)
- Solving Partial Order Constraints for LPO Termination (Q3527280) (← links)