Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for free
Our Free Plans just got better! | Auth0
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.
Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.
This projects has the intent to take any file that has a header and any number of lines, take out the blank lines, the carriage return and the line feed, given as delimitation the "project number" format and generates a new clean file.
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
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.
Application provide indexing and searching capability using Inverted File & TVSM methods. Also provide native integration with UNIX based indexing service also GoogleBase & YouTube search via Atom feeds.
OptorSim is a Grid simulator designed to test dynamic replication strategies used in optimising data location within a Grid. Each simulated site contains several storage or computing elements. Simulated jobs run and file accesses may trigger replication.
The main goal of OWLVE is to visualize graphically any OWL–lite file. Using powerful RCP and GEF technologies will improve the quality of graphics and diagrams.This project includes an algorithm for similarity calculus between two OWL files.
Open Source IM and voice client using Jabber and SIP protocols, with great audio quality thanks to speex and a nice and clean interface. Programmed in Java and C++. It supports chat, voice and file transfers.
Build gen AI apps with an all-in-one modern database: MongoDB Atlas
MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
SMSCompress is a project of investigation, development and implementation of different SMS compression techniques.
Using these techniques, SMS of more than 160 characters can be sent at only one SMS, saving money to the user ;)
PileWorks provides the organizational structure for coordinating several different projects which approach some aspect of Pile Technology. PileWorks defines a set of interfaces and implements some basic infrastructure for Pile engines and agents.
neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).
The OS561 operating system based around FORTH/Java. The OS is to run on a VHDL chip OpenHardware design called the Minon, but could become available for other platforms. The unique point of the design is a revolutionary data compression technology.
NeoBio is a Java class library of Computational Biology Algorithms. The current version consists mainly of pairwise sequence alignment algorithms such as the classical dynamic programming methods of Needleman-Wunsch and Smith-Waterman.
Procedural content generation of deterministic and complex entities, with properties and other entities inside, defined by an editable XML file, along with a framework to simulate actions, compositions, and interactions of entities.