Search Results for "ns2 code with algorithm" - Page 2
Sort By:
Showing 366 open source projects for "ns2 code with algorithm"
View related business solutions-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
1
word_cloud
A little word cloud generator in Python
A little word cloud generator in Python. The code is tested against Python 2.7, 3.4, 3.5, 3.6 and 3.7. If you are using conda, you can install from the conda-forge channel. wordcloud depends on numpy and pillow. To save the wordcloud into a file, matplotlib can also be installed. If there are no wheels available for your version of python, installing the package requires having a C compiler set up. Before installing a compiler, report an issue describing the version of python and operating... -
2
YAPF
A formatter for Python files
YAPF is a Python code formatter that automatically rewrites source to match a chosen style, using a clang-format–inspired algorithm to search for the “best” layout under your rules. Instead of relying on a fixed set of heuristics, it explores formatting decisions and chooses the lowest-cost result, aiming to produce code a human would write when following a style guide. -
3
CodeGuide
This repository is a collection of the author, Xiao Fuge
CodeGuide is a curated collection of Java development resources built from years of real-world engineering experience by the author, who has worked extensively in large-scale internet companies. The project serves as a structured and comprehensive learning path for developers who want to strengthen their understanding of Java fundamentals and core programming practices. It includes detailed explanations of design patterns, source code analysis, frameworks, algorithms, and real-world project... -
4
The Operator Splitting QP Solver
The Operator Splitting QP Solver
OSQP uses a specialized ADMM-based first-order method with custom sparse linear algebra routines that exploit structure in problem data. The algorithm is absolutely division-free after the setup and it requires no assumptions on problem data (the problem only needs to be convex). It just works. OSQP has an easy interface to generate customized embeddable C code with no memory manager required. OSQP supports many interfaces including C/C++, Fortran, Matlab, Python, R, Julia, Rust. -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
RL with PyTorch
Clean, Robust, and Unified PyTorch implementation
RL with PyTorch is a research-oriented repository that provides implementations of deep reinforcement learning algorithms using the PyTorch framework. The project focuses on helping developers and researchers understand reinforcement learning methods by providing clean and reproducible implementations of well-known algorithms. It includes code for popular deep reinforcement learning techniques such as Deep Q-Networks, policy gradient methods, actor-critic architectures, and other modern RL... -
6
Comeonin
Password hashing specification for the Elixir programming language
Comeonin is the long-standing password-security library for Elixir that standardizes secure hashing and verification practices in Phoenix and Plug applications. It provides a uniform interface for modern algorithms such as Argon2, Bcrypt, and PBKDF2 (implemented in companion packages), along with guidance for salts, cost factors, and timing-safe comparisons. The library’s helpers make it straightforward to add registration and login flows that resist brute-force and side-channel attacks.... -
7
MiniSom
MiniSom is a minimalistic implementation of the Self Organizing Maps
...Minisom is designed to allow researchers to easily build on top of it and to give students the ability to quickly grasp its details. The project initially aimed for a minimalistic implementation of the Self-Organizing Map (SOM) algorithm, focusing on simplicity in features, dependencies, and code style. Although it has expanded in terms of features, it remains minimalistic by relying only on the numpy library and emphasizing vectorization in coding style. -
8
Machine learning algorithms
Minimal and clean examples of machine learning algorithms
Machine learning algorithms is an open-source repository that provides minimal and clean implementations of machine learning algorithms written primarily in Python. The project focuses on demonstrating how fundamental machine learning methods work internally by implementing them from scratch rather than relying on high-level libraries. This approach allows learners to study the mathematical and algorithmic details behind widely used models in a transparent and readable way. The repository... -
9
amrlib
A python library that makes AMR parsing, generation and visualization
...A QT-based GUI to facilitate the conversion of sentences to graphs and back to sentences. Methods to plot AMR graphs in both the GUI and as library functions. Training and test code for both the StoG and GtoS models. A SpaCy extension that allows direct conversion of SpaCy Docs and Spans to AMR graphs. Sentence to Graph alignment routines FAA_Aligner (Fast_Align Algorithm), based on the ISI aligner code detailed in this paper. RBW_Aligner (Rule Based Word) for a simple, single token to single node alignment. -
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
Gen.jl
A general-purpose probabilistic programming system
...Gen features an easy-to-use modeling language for writing down generative models, inference models, variational families, and proposal distributions using ordinary code. But it also lets users migrate parts of their model or inference algorithm to specialized modeling languages for which it can generate especially fast code. Users can also hand-code parts of their models that demand better performance. Neural network inference is fast, but can be inaccurate on out-of-distribution data, and requires expensive training. -
11
machine-learning-refined
Master the fundamentals of machine learning, deep learning
machine-learning-refined is an educational repository designed to help students and practitioners understand machine learning algorithms through intuitive explanations and interactive examples. The project accompanies a series of textbooks and teaching materials that focus on making machine learning concepts accessible through visual demonstrations and simple code implementations. Instead of presenting algorithms purely through mathematical derivations, the repository emphasizes geometric... -
12
MLJAR Studio
Python package for AutoML on Tabular Data with Feature Engineering
We are working on new way for visual programming. We developed a desktop application called MLJAR Studio. It is a notebook-based development environment with interactive code recipes and a managed Python environment. All running locally on your machine. We are waiting for your feedback. The mljar-supervised is an Automated Machine Learning Python package that works with tabular data. It is designed to save time for a data scientist. It abstracts the common way to preprocess the data,... -
13
International Components for Unicode
The home of the ICU project source code
ICU is a mature, widely used set of C/C++ and Java libraries providing Unicode and Globalization support for software applications. ICU is widely portable and gives applications the same results on all platforms and between C/C++ and Java software. ICU is released under a nonrestrictive open-source license that is suitable for use with both commercial software and with other open-source or free software. Convert text data to or from Unicode and nearly any other character set or encoding.... -
14
minbpe
Minimal, clean code for the Byte Pair Encoding (BPE) algorithm
minbpe is a minimal, clean implementation of byte-level Byte Pair Encoding (BPE), the tokenization approach widely used in modern language models. It operates on UTF-8 encoded bytes rather than Unicode characters, which makes it robust to arbitrary text inputs and avoids needing a language-specific character vocabulary. The repository is structured as a teaching-oriented implementation that shows how to train a tokenizer by learning merge rules, then apply those merges to encode text into... -
15
Random Cut Forest by AWS
An implementation of the Random Cut Forest data structure
This repository contains implementations of the Random Cut Forest (RCF) probabilistic data structure. RCFs were originally developed at Amazon to use in a nonparametric anomaly detection algorithm for streaming data. Later new algorithms based on RCFs were developed for density estimation, imputation, and forecasting. The different directories correspond to equivalent implementations in different languages, and bindings to to those base implementations, using language-specific features for... -
16
JSToolNpp
A JavaScript tool for Notepad++ and Visual Studio Code
A JavaScript (JSON) tool for Notepad++ (formerly JSMinNpp) and Visual Studio Code. * Douglas Crockford's JSMin algorithm to minimize JavaScript code. * My own algorithm to format JavaScript code. * A JSON tree viewer. The JSON tree viewer for Notepad++ can handle >10MB JSON file easily. * Support 64bit Notepad++ (from version 1.20.0, ".64.zip" package). Really helpful to JavaScript coder on Notepad++ and Visual Studio Code. ... -
17
LinearSolve.jl
High-Performance Unified Interface for Linear Solvers in Julia
LinearSolve.jl is a unified interface for the linear solving packages of Julia. It interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. Performance is key: the current methods are made to be highly performant on scalar and statically sized small problems, with options for large-scale systems. If you run into any performance issues, please file an issue. -
18
Boehm-Demers-Weiser Garbage Collector
The Boehm-Demers-Weiser conservative C/C++ Garbage Collector
The Boehm-Demers-Weiser conservative garbage collector can be used as a garbage collecting replacement for C malloc or C++ new. It allows you to allocate memory basically as you normally would, without explicitly deallocating memory that is no longer useful. The collector automatically recycles memory when it determines that it can no longer be otherwise accessed. The collector is also used by a number of programming language implementations that either use C as intermediate code, want to... -
19
AI-Job-Notes
AI algorithm position job search strategy
AI-Job-Notes is a pragmatic notebook for landing roles in machine learning, computer vision, and related engineering tracks. It assembles study paths, checklists, and interview prep materials, but also covers job-search mechanics—portfolio building, resume patterns, and communication tips. The emphasis is on doing: practicing with project ideas, setting up reproducible experiments, and showcasing results that convey impact. It ties technical study (ML/DL fundamentals) to real hiring signals... -
20
DynamicHMC
Implementation of robust dynamic Hamiltonian Monte Carlo methods
Implementation of robust dynamic Hamiltonian Monte Carlo methods in Julia. In contrast to frameworks that utilize a directed acyclic graph to build a posterior for a Bayesian model from small components, this package requires that you code a log-density function of the posterior in Julia. Derivatives can be provided manually, or using automatic differentiation. Consequently, this package requires that the user is comfortable with the basics of the theory of Bayesian inference, to the extent... -
21
BotSharp
AI Multi-Agent Framework in .NET
Conversation as a platform (CaaP) is the future, so it's perfect that we're already offering the whole toolkits to our .NET developers using the BotSharp AI BOT Platform Builder to build a CaaP. It opens up as much learning power as possible for your own robots and precisely control every step of the AI processing pipeline. BotSharp is an open source machine learning framework for AI Bot platform builder. This project involves natural language understanding, computer vision and audio... -
22
Delta
A viewer for git and diff output
Code evolves, and we all spend time studying diffs. Delta aims to make this both efficient and enjoyable: it allows you to make extensive changes to the layout and styling of diffs, as well as allowing you to stay arbitrarily close to the default git/diff output. Language syntax highlighting with color themes. Within-line highlights based on a Levenshtein edit inference algorithm. -
23
shadowsocks-libev
Bug-fix-only libev port of shadowsocks
Shadowsocks-libev is a lightweight secured SOCKS5 proxy for embedded devices and low-end boxes. Shadowsocks-libev is written in pure C and depends on libev. It's designed to be a lightweight implementation of shadowsocks protocol, in order to keep the resource usage as low as possible. Snap is the recommended way to install the latest binaries. You can build shadowsocks-libev and all its dependencies by script. The latest shadowsocks-libev has provided a redir mode. You can configure your... -
24
Go Katas
A collection of daily coding challenges
...Because Go is widely used for backend services, cloud tooling, and systems programming, this repository helps participants build confidence in writing reliable, idiomatic, and maintainable code in real environments. -
25
Tarsier
Vision utilities for web interaction agents
At Reworkd, we iterated on all these problems across tens of thousands of real web tasks to build a powerful perception system for web agents... Tarsier! In the video below, we use Tarsier to provide webpage perception for a minimalistic GPT-4 LangChain web agent. Tarsier visually tags interactable elements on a page via brackets + an ID e.g. [23]. In doing this, we provide a mapping between elements and IDs for an LLM to take actions upon (e.g. CLICK [23]). We define interactable elements...
