Stop waiting on engineering. Build production-ready internal tools with AI—on your company data, in your cloud.
Retool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
Try Retool free
Outgrown Windows Task Scheduler?
Free diagnostic identifies where your workflow is breaking down—with instant analysis of your scheduling environment.
Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are:
· Solvexo solver is based on the efficient implementation of the simplex method (one or two phases);
· Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming.
· Solvexo provides a solution with the graphic method for problems with...
Wienert S, Heim D, Kotani M, Lindequist B, Stenzinger A, Ishii M, Hufnagl P, Beil M, Dietel M, Denkert C, Klauschen F. CognitionMaster: an object-based image analysis framework. Diagn Pathol 2013, 8:34
The class 'JSEvaluator' in this project allows us to interpret expressions in JScript, allowing us to use parameters in the server at runtime.
For example:
({@ 1} + {@ 2}) / 100;
Parameter {@ 1} : 36
Parameter {@ 2}: 45
Result of the expression: 0.81
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.
Shears is a C# library for list processing, combinatorial problems, and functional programming. It is intended to be useful for everyday coding, with an emphasis on producing brief, readable code. It's also lots of fun!
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.
Many people love programming contests. There are tons of contests or online judges like TopCoder, UVA, SPOJ, etc. This project's goal is to store and keep track of what a programmer have done and studied so far.
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.
A "programming language" that can generate random strings. Useful for creating password, but has many other uses (it can generate IP addresses, fully random but pronounceable words, ..., anything that a string can represent). Written in C#
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.
LispSharp is a fully compiled lisp implementation for the .NET Framework.
It uses a Lisp dialect similar to ISO Lisp, it has a Command-line toplevel
compiler with Read Compile Print Loop.It references any .NET DLL and produces standard .NET assembly.
Provides functional programming abstractions for C# including map, fold, filter functions for .NET collections, the option data type, a lazy type, a functional list type, lazy functional lists, and more. Superseded by http://sf.net/projects/sasa/
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 Variations using C# Generics
http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G