That is, p1 may be thought of as the density of the constraint graph, and p2 as the tightness of constraints. The randomly generated (binary) CSPs are characterised by the 4-tuple (n, m,p1,p2), where n is the number of variables, m is the uniform domain size, p1 is the portion of the n * (n - 1) /2 possible constraints in the graph, and p2 is the portion of the m*m value pairs in each constraint that are disallowed by the constraint. Vidal Description: This is the implementation of the uniform Random Binary DisCSP generator. Title: Uniform Random Binary DisCSP Generator Author: Ionel Muscalagiu, Jose M. Random Binary DisCSP Generator(5RC4).nlogo (For example, if you have multiple applets in differentĭirectories on the same web server, you may want to putĪ single copy of NetLogoLite.jar in one central place andĬhange the archive= lines of all the HTML files to point In the HTML code to point to their actual locations. If NetLogoLite.jar and your model are in differentĭirectories, you must modify the archive= and value= lines and ending with, and paste it into any HTMLįile you want. If you want, you can just take the HTML code beginning with You don't need to include everything in this file in your page. Though, so if it doesn't work from your hard drive, please try On some systems, you can test the applet locally on your computerīefore uploading it to a web server. (You can copy NetLogoLite.jarįrom the directory where you installed NetLogo.) (Random Binary DisCSP Generator(5RC4).nlogo), and the file NetLogoLite.jar In order for this to work, this file, your model file Windows and Linux users may obtain the latest Java from Mac users must have Mac OS X 10.4 or higher. Java must be enabled in your browser settings. This page was automatically generated by NetLogo 5.0RC4.
0 Comments
Leave a Reply. |