Open Source JavaScript Algorithms - Page 2

JavaScript library intended to simplify writing OOP in JavaScript which represents alternative JavaScript inheritance approach, provides support of JavaScript classes hierarhies, automatic resolving and optimizing external scripts files dependencies.

JSONER is a JavaScript library intented to simplify most used operations with JSON based on event API on JSON tree. It includes: data lookup and binding solution, HTML form by JSON dynamically creation and population, transformation and comparison JSONs.

Javascript-based Parser for Smarty-templates.

An online judge system to judge the ACM-ICPC programming contests.

LZF compression/decompression. Implementation for JavaScript. Compatible with lzf_compress & lzf_decompress PHP functions (see LZF in PECL) Based on C source of LZF functions by Marc Alexander Lehmann <schmorp@schmorp.de> Based on C source of LZF PHP extension by Marcin Gibula <mg@iceni.pl> Working example <http://javascriptarchiver.org/>

This repository is a comprehensive personal journal of LeetCode problem-solving journey. It includes detailed solutions with code, algorithm insights, data structure summaries, Anki flashcards, daily challenge logs, and future planning sections.

Math tools in Python to tackle down problems in Operational Research fields. Comes with a Django based web interface to allow remote access to complex simulation means.

Moving target detection in 2D using Kalman Filter written in JS for demo purposes.

Turn-based strategy game for developers/technical experienced users, based on neural networks, algorithmic programming languages and other techniques.

The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.

OpenYPDatePicker is a webcontrol for Asp.Net Ajax-based and written in C Sharp to provide a calendar culture based with capablity to connect to a database to retrieve informations like a sheduler.

This library allows you to generate a random number in the specified range from 0 to n, without using the built-in function Math.random (), and gets a random number from the processing time of polymorphic mathematical calculations, which depends on the current physical parameters of the CPU, RAM, and t .P. The resulting sequence corresponds to a discrete uniform distribution and is close to natural random sequences in terms of statistical randomness tests (LFSR, Approximate Entropy, DIEHARD Test).

RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support. Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations. The demos contain visualization of trees generated from 50k bulk-loaded random points. Open web console to see benchmarks; click on buttons to insert or remove items; click to perform search under the cursor. An optional argument to RBush defines the maximum number of entries in a tree node. 9 (used by default) is a reasonable choice for most applications. Higher value means faster insertion and slower search, and vice versa.

Standard Compression Scheme for Unicode. Implementation for PHP and JavaScript. See <http://www.unicode.org/reports/tr6/> for detailed information about SCSU. Suitable for better LZF compression for UTF-8 strings Based on Java source of SCSU by Unicode, Inc. <http://www.unicode.org/reports/tr6/> Working example <http://javascriptarchiver.org/>

Небольшая и быстрая библиотека написанная на javascript, которая генерирует псевдослучайные числа с практически непредсказуемым разбросом вероятности выпадения для каждого генерируемого числа, а также случайно динамическими границами диапазона псевдослучайной последовательности (для каждого генерируемого числа). Другими словами: эта библиотека ведет себя настолько не предсказуемо, что иногда выдает неопределенное значение (NaN) или бесконечность (Infinity), и почему это происходит не знает даже сам разработчик!

The supervised-reptile repository contains code associated with the paper “On First-Order Meta-Learning Algorithms”, which introduces Reptile, a meta-learning algorithm for learning model parameter initializations that adapt quickly to new tasks. The implementation here is aimed at supervised few-shot learning settings (e.g. Omniglot, Mini-ImageNet), not reinforcement learning, and includes scripts to run training and evaluation for few-shot classification. The fundamental idea is: sample a task, train on that task (inner loop), and then move the initialization parameters toward the adapted parameters (outer loop). Because Reptile is a first-order algorithm, it avoids computing second derivatives or full meta-gradients, making it computationally simpler while retaining good performance. The repo includes training scripts, dataset fetchers (Omniglot, Mini-ImageNet), and modules for defining the Reptile update logic, variables, and hyperparameters.

Ky eshte nje projekt i HAPUR/FALAS per publikun Shqip-foles i cili permban nje seri Video-Kursesh, Udhezime, dhe Shembuj Kodi per gjuhe (web) si: XHTML, CSS, JS, PHP, AS3 etj. si dhe per Desktop: C++, Java, Adobe Air etj. + programe/praktika te ndryshme.

Track your friends in real time on a map.. and many more features

Zero Sum Game Solver JavaScript Library

Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc.

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning

Programming Navigation is not just a website, but a complete ecology with the goal of "helping everyone discover high-quality programming resources and improve learning efficiency". It contains multiple sub-projects, and the technology stack includes React, Java SpringBoot, Tencent Cloud Development, etc., all of which are open source for everyone to learn, so that you can easily develop beautiful information navigation websites! Most of the programming navigation websites are in disrepair and have good navigation, but they are limited in search and classification, and they do not have functions such as self-recommendation and liking, so they are not sustainable.

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.

The Eight Queens Problem is a chess board puzzle. Eight queens can be placed on the chess board without conflict. Any queen placed on the chess board will not attack any other queen. JavaScript programming language is used.