Search Results for "path-movement"
Sort By:
Showing 7 open source projects for "path-movement"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
1
Unified Communication X
Communication framework for data-centric high-performance applications
Accelerate Your Network Performance with UCX. Collaboration between industry, laboratories, and academia to create an open-source, production-grade communication framework for data-centric and high-performance applications. Unified Communication X (UCX) is an award winning, optimized production proven communication framework for modern, high-bandwidth and low-latency networks. UCX exposes a set of abstract communication primitives which utilize the best of available hardware resources and... -
2
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. -
3
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. -
4
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. -
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.
-
5
FtpDrive
Emulates logical drive with mounted FTP/FTPS servers
...Completely implements read operations for FTP files Partially implements write operations for FTP files (see 'How to use') Can intercept opening ftp:// links from other applications - simple press Ctrl key while opening ftp:// path and it will be opened on FtpDrive Compatible with many applications, except those, that uses own drivers to access files Caches directories structure and read files data This is old project, just decided to share its sources -
6
Icmp Ping for Java by ShortPasta
ICMP ping for Java
<WARNING> <WARNING> <WARNING> "Icmp Ping for Java" is now icmp4j, with native implementations for Linux, Mac, Solaris, Windows. Currently hosted here: https://sourceforge.net/projects/icmp4j/ Website: www.icmp4j.org </WARNING> </WARNING> </WARNING> ShortPasta-icmp is an ICMP ping implementation for Java with a simple and clean API. Windows is supported natively. Linux is supported by spawning ping. If you can provide other native implementations, please contact the author! -
7
C++ library for parsing and generating RFC-compliant Uniform Resource Identifiers (URI). Contains classes for URI scheme, authority, path, query, fragment, and the combined URI.
- Previous
- You're on page 1
- Next
