<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8580</REFNUM><AUTHORS><AUTHOR>MacIntyre,E.</AUTHOR><AUTHOR>Prosser,P.</AUTHOR><AUTHOR>Smith,B.M.</AUTHOR></AUTHORS><YEAR>1998</YEAR><TITLE>Random Constraint Satisfaction: Theory Meets Practice</TITLE><PLACE_PUBLISHED>Principles and Practice of Constraint Programming - CP98: 4th International Conference, CP98, Pisa, Italy, October 1998. Proceedings</PLACE_PUBLISHED><PUBLISHER>LNCS, Springer</PUBLISHER><PAGES>325-339</PAGES><ISBN>1611-3349</ISBN><LABEL>MacIntyre:1998:8580</LABEL><KEYWORDS><KEYWORD>random constraint satisfaction problems</KEYWORD></KEYWORDS<ABSTRACT>We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble in the limit. We survey the literature to identify experimental studies that lie within the scope of this result. We then estimate theoretically and measure experimentally the size at which problems start to become trivially insoluble. Our results demonstrate that most (but not all) of these experimental studies are luckily unaffected by this result. We also study an alternative model of random problems that does not suffer from this asymptotic weakness. We show that, at a typical problem size used in experimental studies, this model looks similar to conventional models. Finally, we generalize this model so that we can independently adjust the constraint tightness and density.</ABSTRACT></RECORD></RECORDS></XML>