Search Results for "a star algorithm path"
Sort By:
Showing 7 open source projects for "a star algorithm path"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
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
pj-tftp-server
Pure Java TFTP server.
Pure Java TFTP server. Free, portable, cross-platform. Fully multi-threaded. Implements RFC 1350. Run as root/admin in cmd-mode with cmd argument = path to folder, for example: java -jar pj-tftp-server.jar /tmp .Need JRE-1.8. Source - https://github.com/harp077/pj-tftp-server If you like this - put a star on https://github.com/harp077/pj-tftp-server/ for support project please. -
2
dupeGuru
Find duplicate files
dupeGuru is a cross-platform GUI application written in Python (with Qt/Cocoa UI) that quickly detects duplicate files on your computer using flexible scanning modes—including filename fuzzy matching, content comparison, and specialized Music/Picture modes. On some linux systems pyrcc5 is not put on the path when installing python3-pyqt5, this will cause some issues with the resource files (and icons). These systems should have a respective pyqt5-dev-tools package, which should also be... -
3
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. -
4
LaPath
Learning Automata 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. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for... -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
5
AcoPath
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. Development takes place at https://github.com/zfoxer/AcoPath -
6
PsoPath
Particle Swarm 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 Particle Swarm Optimization is the emulation of the social behaviour of, e.g., a flock of birds, as a stochastic optimisation method. Specifically, a particle is an entity representing a solution in the search space. Several particles cooperate... -
7
PPAT, or Parallel Path following Algorithm using Triangles, is a reliable parallel tool to trace the level curves of any continuous, not necessarily smooth, function f(z): C → R.
- Previous
- You're on page 1
- Next
