<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML><HEAD><TITLE>2.10 Models</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node11.html#section.constraints.order"><< Prev</A></TD><TD><A href="node2.html">- Up -</A></TD></TR></TABLE><DIV id="section.constraints.models"><H2><A name="section.constraints.models">2.10 Models</A></H2><P>A <A name="label40"></A><EM>model</EM> of a problem is a representation of the problem as a finite domain problem (as defined in <A href="node3.html#section.constraints.constraints">Section 2.1</A>). A model specifies the variables and the constraints representing the problem. </P><P>Nontrivial problems will admit different models and different distribution strategies, coming with different computational properties and search trees of different size. The art of constraint programming consists in finding for a problem a model and a distribution strategy that yield a computationally feasible search tree.</P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node11.html#section.constraints.order"><< Prev</A></TD><TD><A href="node2.html">- Up -</A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A> and <A href="http://www.ps.uni-sb.de/~smolka/">Gert Smolka</A><BR><SPAN class="version">Version 1.4.0 (20090610)</SPAN></ADDRESS></BODY></HTML>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
bd5c3d824c3db63ffd9226c15941e6ad
>
files
>
1184
