<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Hybrid algorithm (constraint satisfaction) - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Hybrid_algorithm_(constraint_satisfaction)&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Hybrid_algorithm_%28constraint_satisfaction%29&amp;p=3">3.Next</a>
</p>
<p>etc.) and <a href="page.php?w=constraint_inference">constraint inference</a> (<a href="page.php?w=arc_consistency">arc consistency</a>, <a href="page.php?w=variable_elimination">variable elimination</a>, etc.)</p>

<p>Hybrid algorithms exploit the good properties of different methods by applying them to problems they can efficiently solve. For example, search is efficient when the problem has many solutions, while inference is efficient in proving unsatisfiability of overconstrained problems.</p>

<p><big>Cycle cutset inference/search algorithm</big></p>
<p>This</p><p>
<a accesskey="1" href="page.php?w=Hybrid_algorithm_(constraint_satisfaction)&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Hybrid_algorithm_%28constraint_satisfaction%29&amp;p=3">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
