The following pages link to (Q4495106):
Displaying 16 items.
- A constraint-based approach to fast and exact structure prediction in three-dimensional protein models (Q850456) (← links)
- Symmetry breaking constraints for value symmetries in constraint satisfaction (Q850460) (← links)
- Symmetry definitions for constraint satisfaction problems (Q850464) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Dynamic structural symmetry breaking for constraint satisfaction problems (Q1037643) (← links)
- Towards breaking more composition symmetries in partial symmetry breaking (Q1677433) (← links)
- Symmetry breaking revisited (Q1774518) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- Pairwise symmetry reasoning for multi-agent path finding search (Q2060696) (← links)
- Lightweight dynamic symmetry breaking (Q2342593) (← links)
- Symmetries, almost symmetries, and lazy clause generation (Q2342601) (← links)
- Dominance breaking constraints (Q2342647) (← links)
- Exploiting relaxation in local search for LABS (Q2468767) (← links)
- The Relation Between Complete and Incomplete Search (Q2950519) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- Exploiting symmetries within constraint satisfaction search (Q5941314) (← links)
