Search Results for "path-setting"
Sort By:
Showing 18 open source projects for "path-setting"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
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.
-
1
Billiards Everything
The Great Periodic Path Hunt at gwtokarsky.github.io
...Download "Billiards Everything" to discover new periodic billiard paths, an unresolved problem from 1775! Download "Billiards Covers" to see the most current list of periodic paths in triangles. Follow "The Great Periodic Path Hunt" at gwtokarsky.github.io for the latest news. Email tokarsky@ualberta.ca for feedback. -
2
NAVAL-SEM
Free offline SEM software with HTMT, bootstrapping & exports
NAVAL-SEM is a free, open-source, fully offline desktop application for Structural Equation Modeling (SEM), supporting both PLS-SEM and CB-SEM workflows. Designed for researchers, PhD scholars, professors, students, and analysts, it enables advanced quantitative research without subscriptions, cloud dependencies, or proprietary software restrictions. Key features include visual drag-and-drop model building, bootstrapping, mediation analysis, HTMT, AVE, Composite Reliability (CR),... -
3
Billiards Covers
This zip jar contains the current coverings of periodic paths.
...Download "Billiards Covers" to see the most current list of periodic paths in triangles. Download "Billiards Everything" to discover new periodic billiard paths, an unresolved problem from 1775! Follow "The Great Periodic Path Hunt" at gwtokarsky.github.io for the latest news. Email tokarsky@ualberta.ca for feedback. -
4
Awesome Math
This is the Curriculum for "How to Learn Mathematics Fast"
...The structure is useful both for newcomers who want a starting plan and for practitioners filling specific gaps before tackling ML or deep learning. Overall, it acts as a compact study plan that turns “learn math” from a vague goal into a concrete, achievable path. -
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
5
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
6
MathFu
C++ math library developed primarily for games focused on simplicity
...It provides fixed-size vector, matrix, and quaternion types with APIs that mirror the operations you actually use in inner loops—dot, cross, normalize, transforms, and projections. Implementations are carefully tuned to leverage SIMD instruction sets such as SSE and NEON while preserving a clean fallback path for portability. Because types are fixed at compile time, the compiler can aggressively inline and unroll code, producing predictable performance and tiny binaries. The design emphasizes minimal dependencies and clear ownership so the library can be embedded into engines without dragging in heavyweight frameworks. It fits equally well in rendering math, physics helpers, animation blending, and camera control logic where determinism and speed matter. -
7
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
8
physicsmata
API for all possible cellular automata that work same at all angles
Its strange how the "sorted pointers" normalizing makes just about any random function, as long as it connects the inputs to the outputs on some path, vibrate as some nonlinear shape of wave. This could be used as a game interface for evolvable musical instruments or fluid puzzle games. Physicsmata is similar in effect to SmoothLife but simpler and pure Java. The cellular automata API takes a function to run at each point. Its parameters are sums of screen brightness (n color dimensions are optional) at concentric circles around each point, efficiently costing only the perimeter of those circles (instead of the area) because of the tree of squares. ... -
9
JAGAL: Java Graph Library
Java graph library
JAGAL provides implementations for directed graphs (weighted and unweighted) and varoius types of transition systems as well as utils for graph traversal and modification. JAGAL builds upon the Java library TOVAL (located at http://sourceforge.net/p/toval). To use JAGAL, make sure the TOVAL library is on the build path. This library uses and encloses jGraphX (https://github.com/jgraph/jgraphx). A documentation for JAGAL can be found under http://doku.telematik.uni-freiburg.de/jagal. -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
SEPIA: Security-oriented PN Framework
Petri net framework for security related modeling and reasoning.
...SEPIA builds upon TOVAL (http://sourceforge.net/p/toval), JAGAL (http://sourceforge.net/p/jagal) and SEWOL (https://sourceforge.net/projects/jawl/). To use SEPIA, make sure these libraries are on the build path. SEPIA encloses the Multi Schema Validator (https://msv.java.net/) and isorelax (http://iso-relax.sourceforge.net/) The documentation can be found under http://doku.telematik.uni-freiburg.de/sepia. -
11
segment
Solve the Viterbi algorithm in a data stream
It is often necessary to assign a series of discrete values to continuosly variable data sequenced by time, position, etc., thereby parsing the data into fewer and larger segments of variable width. The 'segment' utility takes an input data stream as a Hidden Markov Model and applies the Viterbi algorithm to find the most likely segmentation path through the data. -
12
Calculate the number of solutions to place n queens on an n*n chess board, without any queen attacking each other. Options allow using rooks instead of queens, disabling knight attacks and setting the minimum distance between queens.
-
13
Simple UI to test the effectiveness of a heuristic algorithm against the brute force method for path finding among an arbitrary number of arbitrarily placed points on a grid. This is an educational project, don't expect new and better methods.
-
14
C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.
-
15
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.
-
16
boost_graph tried to wrap the C++ Boost Graph library in Python, providing graph algorithms like Breadth First Search, DFS, Shortest Path, Topological sort. This project is dead (http://bayleshanks.com/pamv1)
-
17
-
18
A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)
- Previous
- You're on page 1
- Next