Search Results for "path"
Sort By:
Showing 13 open source projects for "path"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
2
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
3
BoostMultiDex
Load multiple dex files on low Android version devices
BoostMultiDex is a specialized Android-library created by ByteDance to address a long-standing performance and user-experience problem on older Android devices (specifically Android 4.x and below, i.e. SDK < 21), where loading multiple dex files after installation or upgrade can lead to extremely long “black-screen” freeze times during first startup. Instead of relying on the standard Android MultiDex mechanism, BoostMultiDex reworks the loading strategy by tapping into hidden Dalvik VM... -
4
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... -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
(RoboSim) Robot Simulator
(RoboSim) Java based Robot Localization and Path Planner Simulator.
Java based portable simulator to visualize and understand the Robot Localization, Path planning, Path Smoothing and PID controller concepts. It is very flexible and easy to use. It supports multiple platforms. The source code is available on Github where you can find latest development and up-to-date documentation. Source : https://github.com/habsoft/robosim Blog : https://robosimblog.wordpress.com Note : Use jre 1.7 to run it. 1.Histogram Filter 2.Histogram Filter with Sonar Range Finder (Experimental) 3.Kalman Filter 4.Particles Filter 5.Path Planning 6.Path Smoothing 7.PID Controller Path Planning Algorithms 1.BFS 2.DFS 3.A Star 4. ... -
6
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. ... -
7
Graphical Grammar Studio
An user friendly grammar tool for natural language processing tasks
Full documentation with tutorials is included in the download package. Graphical Grammar Studio is a tool for applying grammars which behave as words acceptors/consumers and annotators. GGS grammars can be used to find and annotate sequences of words which respect certain conditions, in a given input. Its purpose is for creating NLP tools like phrase chunkers, named entity finders, pronoun co-reference solvers etc. A grammar is represented by a state machine which can be visualized, edited... -
8
AI Path
AI Pathfinding Presentation
Presentation of pathfinding algorithms Howto: 1. Create Map (manual or use Map -> Rapid Deployment) 2. Select start point 3. Select end point 4. Choose alg 5. Click Path -> Find -
9
An easy to extend, highly graphical, easy to use 2D robot simulator specialized for path planning algorithms. Can be used in testing various robotic algorithms, and already used for comparison of path planning algorithms like RRT, RRTConnect, PRM, RboT..
-
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
10
-
11
The goal of the Rats and Mazes project is to build a simple genetic algorithm to find general solutions to random non-cyclic single path mazes. I believe that the solutions will tend towards either the right/left-hand rule.
-
12
A project originally for an undergraduate Freshman seminar on motion planning algorithms. Provides a basic interface for drawing obstacles in a 2-D plane and the ability to select an algorithm by which to plan a path in this user-defined world.
-
13
videonetwork
A simulator for self-organizing video replication and more
...We tackle these problems by introducing a bio-inspired algorithm, which lets the content place itself where it is needed. It is robust, scalable and adaptive. The transport path of content is exploited to replicate content and limited storage space is handled by clean-up mechanisms. We implemented a simulator to show the algorithm's performance and to test its behavior under real circumstances. It is easily extendable to support several new scenarios or changes to the algorithm (see replication and client models).
- Previous
- You're on page 1
- Next
