<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Checkpoints and Final Submission on CS 412</title>
		<link>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/</link>
		<description>Recent content in Checkpoints and Final Submission on CS 412</description>
		<generator>Hugo</generator>
		<language>en</language>
		
		
		
		
			<atom:link href="/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Checkpoint 1: Getting Started and Project Selection</title>
				<link>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-1/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-1/</guid>
				<description>&lt;div style=&#34;display: flex; justify-content: space-between; align-items: center; gap: 1rem; padding-top: 72px; margin-bottom: 0.75rem;&#34;&gt;&#xA;  &lt;a href=&#34;../&#34;&gt;All Checkpoints&lt;/a&gt;&#xA;  &lt;a href=&#34;../checkpoint-2/&#34;&gt;Checkpoint 2 →&lt;/a&gt;&#xA;&lt;/div&gt;&#xA;&lt;h1&gt;Checkpoint 1: Getting Started and Project Selection&lt;/h1&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Goal:&lt;/strong&gt; Set up your team repository, verify that every team member can work with it, and provide the information needed for project assignment.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;h3 id=&#34;getting-started&#34;&gt;Getting Started&lt;/h3&gt;&#xA;&lt;p&gt;Before completing the Checkpoint 1 requirements, review the &lt;a href=&#34;../../repository/&#34;&gt;Project Repository and Infrastructure&lt;/a&gt; page. It explains how to create your team repository through Classroom 50, clone it, and understand the organization of the provided course infrastructure and student implementation files.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Checkpoint 4: Experimental Investigation</title>
				<link>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-4/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-4/</guid>
				<description>&lt;section class=&#34;course-title-section&#34;&gt;&#xA;  &lt;h1&gt;Checkpoint 4: Experimental Investigation&lt;/h1&gt;&#xA;&lt;/section&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;&lt;strong&gt;Goal:&lt;/strong&gt; Use the completed algorithms and bound to determine where the methods are practical, how solution quality changes when exact computation is no longer available, and what characteristics of an instance affect algorithm behavior.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;Checkpoint 4 shifts the emphasis from implementation to &lt;strong&gt;controlled experimental investigation&lt;/strong&gt;. The course provides the required benchmark collections and experiment-running infrastructure. You are &lt;strong&gt;not&lt;/strong&gt; required to write a benchmark harness or create the required benchmark universe yourself.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Approved Add-ons and Extensions</title>
				<link>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/add-ons/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/add-ons/</guid>
				<description>&lt;section class=&#34;course-title-section&#34;&gt;&#xA;  &lt;h1&gt;Approved Add-ons and Extensions&lt;/h1&gt;&#xA;&lt;/section&gt;&#xA;&lt;p&gt;Optional add-ons allow a team to pursue an idea beyond the core requirements without creating another checkpoint or an alternate path around required work. Examples include a polynomial-time special case, a stronger exact method, an additional heuristic, adversarial-instance generation, parameter-sensitivity analysis, a reduction experiment, a larger benchmark universe, or parallel benchmark execution.&lt;/p&gt;&#xA;&lt;p&gt;A team that wants to pursue an add-on should propose it &lt;strong&gt;no later than the Checkpoint 3 submission&lt;/strong&gt;. The proposal should identify what will be built or investigated, how success will be evaluated, and how the work complements the required project. The instructor must approve the scope before the team treats it as part of the project plan.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Final Project Submission</title>
				<link>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/final/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/final/</guid>
				<description>&lt;section class=&#34;course-title-section&#34;&gt;&#xA;  &lt;h1&gt;Final Project Submission&lt;/h1&gt;&#xA;&lt;/section&gt;&#xA;&lt;p&gt;The final project consists of the complete repository, a concise report, a class presentation, and peer questions.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Complete repository.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;The repository should contain the final implementations, tests, experimental scripts, results, checkpoint reports, and presentation materials. Someone outside your team should be able to clone the repository and reproduce the important results by following the instructions in &lt;code&gt;README.md&lt;/code&gt;. The final Gradescope assessment will perform a cumulative validation of the required repository structure and algorithm interfaces.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Checkpoint 2: Foundation</title>
				<link>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-2/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-2/</guid>
				<description>&lt;div style=&#34;display: flex; justify-content: space-between; align-items: center; gap: 1rem; padding-top: 72px; margin-bottom: 0.75rem;&#34;&gt;&#xA;  &lt;a href=&#34;../checkpoint-1/&#34;&gt;← Checkpoint 1&lt;/a&gt;&#xA;  &lt;a href=&#34;../&#34;&gt;All Checkpoints&lt;/a&gt;&#xA;  &lt;a href=&#34;../checkpoint-3/&#34;&gt;Checkpoint 3 →&lt;/a&gt;&#xA;&lt;/div&gt;&#xA;  &lt;h1&gt;Checkpoint 2: Foundation&lt;/h1&gt;&#xA;&lt;p style=&#34;font-size: 1.2rem; margin-top: 0.5rem;&#34;&gt;&#xA;  &lt;strong&gt;Goal:&lt;/strong&gt; Understand the theoretical and computational structure of your problem and establish a trustworthy exhaustive baseline whose search space is measurable.&#xA;&lt;/p&gt;&#xA;&lt;p&gt;Checkpoint 2 has two parts: &lt;strong&gt;Build and Validate the Baseline&lt;/strong&gt; and &lt;strong&gt;Analyze and Plan&lt;/strong&gt;.&#xA;The written analysis produced in Part B belongs in &lt;code&gt;reports/checkpoint2.pdf&lt;/code&gt;&#xA;Organize the report using clearly labeled sections corresponding to the six analysis topics in Part B.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Checkpoint 3: Improved Algorithms</title>
				<link>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-3/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>/molloykp/teaching/cs412_f26/pas/npcompleteproject/checkpoints/checkpoint-3/</guid>
				<description>&lt;div style=&#34;display: flex; justify-content: space-between; align-items: center; gap: 1rem; padding-top: 72px; margin-bottom: 0.75rem;&#34;&gt;&#xA;  &lt;a href=&#34;../checkpoint-2/&#34;&gt;← Checkpoint 2&lt;/a&gt;&#xA;  &lt;a href=&#34;../&#34;&gt;All Checkpoints&lt;/a&gt;&#xA;  &lt;a href=&#34;../checkpoint-4/&#34;&gt;Checkpoint 4 →&lt;/a&gt;&#xA;&lt;/div&gt;&#xA;&lt;h1&gt;Checkpoint 3: Improved Algorithms&lt;/h1&gt;&#xA;&lt;p style=&#34;font-size: 1.2rem; margin-top: 0.5rem;&#34;&gt;&#xA;&lt;p&gt;&lt;strong&gt;Goal:&lt;/strong&gt; Move beyond complete-candidate enumeration by implementing&#xA;a more selective exact algorithm, developing a polynomial-time method for bounding&#xA;the optimal solution value, and implementing the first scalable heuristic.&lt;/p&gt;&#xA;&lt;p&gt;Checkpoint 2 established an exhaustive baseline by generating complete candidate solutions before testing them. In Checkpoint 3, you will use information about partial solutions or subproblems to fail early and avoid generating large portions of that candidate space. The improved algorithm must remain exact—that is, it must still return an optimal solution.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
