With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Cloud tools for web scraping and data extraction
Deploy pre-built tools that crawl websites, extract structured data, and feed your applications. Reliable web data without maintaining scrapers.
Automate web data collection with cloud tools that handle anti-bot measures, browser rendering, and data transformation out of the box. Extract content from any website, push to vector databases for RAG workflows, or pipe directly into your apps via API. Schedule runs, set up webhooks, and connect to your existing stack. Free tier available, then scale as you need to.
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
Der KND Decoder konvertiert die lästigen Zahlenwerte, in den Java Dateien vom Knuddels Applet, zu lesbaren Strings. Die neue dekodier Methode wurde auch beachtet, die den HuffmanString etc. konvertiert.
An encryption library written in C# on .net 2.0, includes SHA1 and MD5 encryption atm. Also includes usercontrols for Visual Studio. Readme can me downloaded separately in the files section.
Atera all-in-one platform IT management software with AI agents
Ideal for internal IT departments or managed service providers (MSPs)
Atera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
A .net implementation of a framework for genetic algorithms. This tool enables programmers to write the "core" of their problem and have a genetic algorithm immediately setup for solving it.
Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.
GEP is an evolutionary algorithm for function finding. This framework is a powerful way of expressing and coding genetic-like structures and quickly finding solutions through evolution by common genetic operators.
USPS One Code - Intelligent Mail Barcode (4-State Customer Barcode) - encoder implementation with VS 2008. Source code in C# and VB.NET and binaries for .NET (1.1, 2.0 and 3.5), .NET CF (2.0 and 3.5) and Mono (1.* and 2.0).
A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.
Multicore SWARM (Software and Algorithms for Running on Multicore Processors) is an open source library for developing efficient and portable implementations that make use of multi-core processors. David A. Bader (Georgia Tech) began SWARM in 1994.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.
A fantacy MMORPG Game where the player has the mission to be a hero in his own right, where the figth is for glory and honour and maybe a broom to put in your broom closet
TextDiff.NET is the .NET component to list differences between two integer arrays using a "longest common subsequence" algorithm. Typically, this component is used to diff 2 text files once their individuals lines have been hashed.
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf.
Requirements:
Microsoft Automatic Graph Layout
http://research.microsoft.com/en-us/projects/msagl/
Gurobi Optimizer
http://www.gurobi.com/
Permutations, Combinations, and...