Matches in DBpedia 2015-10 for { ?s ?p "In constraint satisfaction, a hybrid algorithm solves a constraint satisfaction problem by the combination of two different methods, for example variable conditioning (backtracking, backjumping, etc.) and constraint inference (arc consistency, variable elimination, etc.) Hybrid algorithms exploit the good properties of different methods by applying them to problems they can efficiently solve."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Hybrid_algorithm_(constraint_satisfaction) comment "In constraint satisfaction, a hybrid algorithm solves a constraint satisfaction problem by the combination of two different methods, for example variable conditioning (backtracking, backjumping, etc.) and constraint inference (arc consistency, variable elimination, etc.) Hybrid algorithms exploit the good properties of different methods by applying them to problems they can efficiently solve.".