The following pages link to (Q4253835):
Displaying 13 items.
- A survey of constraint-based programming paradigms (Q458465) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- Conditional lexicographic orders in constraint satisfaction problems (Q846134) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Reduction operations in fuzzy or valued constraint satisfaction (Q1873182) (← links)
- On-line resources allocation for ATM networks with rerouting (Q2489130) (← links)
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems (Q2643303) (← links)
- Semiring-Based Soft Constraints (Q3507363) (← links)
- (Q5743434) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)