<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://termination-portal.org/mediawiki/index.php?action=history&amp;feed=atom&amp;title=Termination_Competition_Problem_Selection_Algorithm</id>
	<title>Termination Competition Problem Selection Algorithm - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://termination-portal.org/mediawiki/index.php?action=history&amp;feed=atom&amp;title=Termination_Competition_Problem_Selection_Algorithm"/>
	<link rel="alternate" type="text/html" href="http://termination-portal.org/mediawiki/index.php?title=Termination_Competition_Problem_Selection_Algorithm&amp;action=history"/>
	<updated>2026-05-11T22:00:06Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.34.2</generator>
	<entry>
		<id>http://termination-portal.org/mediawiki/index.php?title=Termination_Competition_Problem_Selection_Algorithm&amp;diff=1407&amp;oldid=prev</id>
		<title>Albert: Created page with &quot;We will fix some number &quot;c&quot; with 0 &lt; c &lt; 1. This number indicates the percentage of problems to be taken from each family. So in principle, we would like to choose c * |F| pro...&quot;</title>
		<link rel="alternate" type="text/html" href="http://termination-portal.org/mediawiki/index.php?title=Termination_Competition_Problem_Selection_Algorithm&amp;diff=1407&amp;oldid=prev"/>
		<updated>2014-05-26T09:48:37Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;We will fix some number &amp;quot;c&amp;quot; with 0 &amp;lt; c &amp;lt; 1. This number indicates the percentage of problems to be taken from each family. So in principle, we would like to choose c * |F| pro...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;We will fix some number &amp;quot;c&amp;quot; with 0 &amp;lt; c &amp;lt; 1. This number indicates the percentage of problems to be taken from each family. So in principle, we would like to choose c * |F| problems from each family F. Here, |F| is the number of problems in the family F.&lt;br /&gt;
&lt;br /&gt;
In order to avoid problems with very large or very small families, there will be two additional numbers &amp;quot;a&amp;quot; and &amp;quot;b&amp;quot; with 0 &amp;lt; a &amp;lt; b. Here, &amp;quot;a&amp;quot; is the minimum number of examples that should be chosen from each family. Similarly, &amp;quot;b&amp;quot; is the maximum number of examples that should be chosen from each family.&lt;br /&gt;
&lt;br /&gt;
To illustrate this, let c = 1/2 and let a = 10 and b = 100. Then for a family F with 50 problems, we would randomly choose c * |F| = 25 problems from the family F. For a family F with 16 problems, we would not choose c * |F| = 8 problems, because this number would be smaller than a = 10. Instead, we would choose a = 10 problems randomly. For a family with 300 problems, we would not choose c * |F| = 150 problems, because this number would be larger than b = 100. Instead, we would choose b = 100 problems randomly.&lt;br /&gt;
&lt;br /&gt;
To summarize, for every family F, we randomly choose:&lt;br /&gt;
&lt;br /&gt;
    c * |F| problems, if a &amp;lt;= c*|F| &amp;lt;= b&lt;br /&gt;
    a       problems, if c*|F| &amp;lt; a           &lt;br /&gt;
    b       problems, if b &amp;lt; c*|F|&lt;br /&gt;
&lt;br /&gt;
This rule is applied to every family with the same numbers a,b,c.&lt;br /&gt;
&lt;br /&gt;
The numbers &amp;quot;a&amp;quot;, &amp;quot;b&amp;quot; and &amp;quot;c&amp;quot; will be chosen such that the competition can complete in time, which depends on the number of new TPDB submissions and participants. (The numbers have been a = 10, b = 75, c = 0.3 in the last year.)&lt;/div&gt;</summary>
		<author><name>Albert</name></author>
		
	</entry>
</feed>