diff options
| author | Amir Saeid <amir@glgdgt.com> | 2026-02-18 21:25:00 +0000 |
|---|---|---|
| committer | Amir Saeid <amir@glgdgt.com> | 2026-02-18 21:25:00 +0000 |
| commit | 32e0e105f663ace08896f22ab4079521070b0cac (patch) | |
| tree | a40cad3ef73d76241f285d263c2574cf1e80c8d6 /public/index.xml | |
| parent | 3e3b3596b4e0d720c68a2d3a3538055dae41a694 (diff) | |
Change the theme and add a new post
Diffstat (limited to 'public/index.xml')
| -rw-r--r-- | public/index.xml | 9 |
1 files changed, 8 insertions, 1 deletions
diff --git a/public/index.xml b/public/index.xml index 904d0f9..cb59f02 100644 --- a/public/index.xml +++ b/public/index.xml @@ -6,9 +6,16 @@ <description>Recent content on </description> <generator>Hugo</generator> <language>en</language> - <lastBuildDate>Tue, 22 Aug 2017 00:00:00 +0000</lastBuildDate> + <lastBuildDate>Tue, 17 Feb 2026 20:59:41 +0000</lastBuildDate> <atom:link href="https://blog.gluegadget.com/index.xml" rel="self" type="application/rss+xml" /> <item> + <title>Fairstream</title> + <link>https://blog.gluegadget.com/post/fairstream/</link> + <pubDate>Tue, 17 Feb 2026 20:59:41 +0000</pubDate> + <guid>https://blog.gluegadget.com/post/fairstream/</guid> + <description><p><a href="https://en.wikipedia.org/wiki/Backtracking">Backtracking</a> is a versatile approach for solving search problems by building solutions incrementally. If a partial solution cannot be extended, it is discarded and the process returns to a previous step to explore an alternative path. This method is generally more efficient than brute-force searching due to pruning: stopping exploration of a branch as soon as it violates a constraint, which eliminates entire sections of the search space.</p>
<p>Strictly speaking, fair backtracking is not required for all search problems. A fair strategy guarantees all branches make progress, preventing any single branch from starving the others. The List monad handles non-deterministic computation well, and within a finite search space it produces the same results as a fair stream. When the search space is infinite, or when one branch may produce unbounded results, fairness becomes essential to ensure completeness.</p></description> + </item> + <item> <title>ThinkPad E470</title> <link>https://blog.gluegadget.com/post/2017-08-22-thinkpad-e470/</link> <pubDate>Tue, 22 Aug 2017 00:00:00 +0000</pubDate> |