Search Results for "algorithm"

Jekyll related_posts function based on tags (works on Jekyll3). It replaces the original Jekyll's related_posts function to use tags to calculate relationships. The calculation algorithm is based on related_posts-jekyll_plugin.

Kintsugi is an innovative open-source project from Lightricks focused on robust perceptual image quality and enhancement, bringing together advanced algorithms for denoising, super-resolution, tone mapping, and stylistic refinement into a cohesive framework. Named after the Japanese art of repair and beauty, Kintsugi embraces imperfect captures and enhances them intelligently, preserving natural detail while reducing noise and artifacts in ways that align with human visual preferences. The...

...In July 2023, work on the second edition was announced, which expands the project with updated content, new problems inspired by recent big-tech interviews, and introductions to modern machine learning techniques such as XGBoost, CNNs, RNNs, and LSTMs. This collection serves both as a historical record of algorithm problem-solving and as a living resource for programmers preparing for interviews.

...Add the gem to your Jekyll application and when you build your site it will generate gzip files for all text based files (HTML, CSS, JavaScript, etc). Zlib's gzipping capabilities don't quite squeeze all the compression out of our files that we could want. If you want a slower but better compression algorithm, check out Jekyll::Zopfli. Zopfli is about the best compression we can get out of the gzip format, but there's more! Brotli is a relatively new compression format that is now supported by many browsers and can produce even smaller files.

DecisionTree is a Ruby library that implements decision tree learning with the ID3 information-gain algorithm. It can train models from discrete, continuous, or mixed attribute data. Continuous features are evaluated across possible split points to build threshold-based binary branches. Discrete models classify unique labels and can be rendered for visual inspection. The library supports inconsistent datasets, multiple or symbolic outputs, and fallback values when no branch matches an input. ...

...Example implementations and worked problems show how to encode solutions, define fitness, and balance exploration with exploitation. The emphasis is on pragmatism—enough theory to understand why an algorithm works, and enough detail to get it running in your environment. It’s a useful starting point for students and practitioners who want to prototype, benchmark, or hybridize algorithms without digging through scattered academic papers.

Free and easy to implement algorithm that can be used for resource leveling in Gantt projects. Uses resources assignment policies, availibility calendars, tasks\' priorities, dependencies, sizings, complexity due to human communication.

Ruby computational geometry library. Shape/Line/Point classes, methods to test shape intersection (using ray-casting algorithm); includes XML parsing script (& sample xml file) to test intersection of shapes documented as ordinal point set in xml.

Common utility methods, classes and algorithm library for general use. Although this library focuses on common utility algorithms, main goal of this library is ease of use by trading some flexibility.

S7r47e50 is an attempt to write a version of Stratego for Linux in Ruby using mySQL for 'opening books', a minimax algorithm as the AI, and TCP/IP bindings for internet multiplayer options. It will be licenses under the GPL v2.