Analyze, optimize, and govern your multi-cloud environment effortlessly with AI Agentic FinOps.
Unlike reporting-only FinOps tools, FinOpsly unifies cloud (AWS, Azure, GCP), data (Snowflake, Databricks, BigQuery), and AI costs into a single system of action — enabling teams to plan spend before it happens, automate optimization safely, and prove value in weeks, not quarters.
Learn More
Intelligent Automation Solutions Built for Modern Finance Teams
We do CFO stuff.
Digitally transform your business with workflow automation and integrated payment solutions. Digitally store and secure your data with advanced search and accessibility features that keeps your documents at the tip of your team’s fingers.
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.
The NA_WorkSheet is a set of algorithms coded in Java that implements various Numerical Analysis techniques. The tool may be used for graphing, root finding, differentiation, integration, interpolation, linear systems solving, and matrix operations.
. From Fortune 500 to small businesses with remote workers, every industry can gain from premium endpoint security.
DriveStrike protects devices and data in the event of loss, theft, or use in remote locations. Remotely locate, lock, and wipe devices you manage to prevent data compromise. DriveStrike prevents data breaches to ensure confidentiality, compliance, and a competitive edge.
GrALoG is a tool for editing and visualising graph-like-structures and the results of algorithms running on them. Through it's plugins GrALoG is hugely extendable, i.e. plugin-developers can define their own graph-like structures and algorithms.
The aim of the project is to provide open source collection of algorithms in the field of spectroscopy: data handling and processing, modeling and artificial intelligence tools.
Combean is a Java framework for mathematical structures and optimization algorithms. Through a set of Java interfaces and JavaBeans-based config, Combean glues optimization codes together - leading to more interoperable, adaptable and flexible solutions.
Outplacement, Executive Coaching and Career Development | Careerminds
Careerminds outplacement includes personalized coaching and a high-tech approach to help transition employees back to work faster.
By helping to avoid the potential risks of RIFs or layoffs through our global outplacement services, companies can move forward with their goals while preserving their internal culture, employer brand, and bottom lines.
a free cross platform calculator for calculating BIG numbers
BigAl is a free open source and platform independent software for calculating really BIG numbers. It supports not only standard arithmetic, but also exact period determination, predefined factorials, fibonacci with seeds, factorization, nth root, etc
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.
RAGE (Random Variate Generator) is a graphical tool for unidimensional discrete distributions. RAGE generates random values and simulates various discrete distributions by using different algorithms.
Magic Fixed Point, it's an library that abstracts the use of fixed point math for environments that doesn't have floating point operations or in places that you don't want to use the traditional floating point operations.
The Simple Interface for Global Optimization Algorithms allows the specification of arbitrary search/optimization problems, solving of these problems, and the specification and implementation of optimization algorithms like evolutionary algorithms.
The simpliZia-program implements the simplex-algorithm and is designed to help students of Operations Research to understand and learn the algorithm. This is a german project, source and program are actually written in german.
Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.
JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.
A full math Java class library containing complex functions and algorithms such as cubic-spline interpolation, least squares, matrix computations. Eventually to make a web based interface to the library using JSP.
M+ Compiler/Interpreter is a interpreter library written in Java that delivers the possibility to extend any Java application with simple scripts. Besides the usage of native datatypes and operations you can instantiate and call native Java objects.
The K.U.Leuven JCHR System is an integration of Constraint Handling Rules (CHR) and Java designed with three aims in mind: user-friendliness, flexibility and efficiency.
http://www.cs.kuleuven.be/~petervw/JCHR/
XMLMath evaluates mathematical, logical or textual expressions described in xml and prints the result. For example, to compute the result of 1 + 1, you would write: <add> <long value="1"/> <long value="1"/> </add>