Search Results for "algorithm"
Sort By:
Showing 6 open source projects for "algorithm"
View related business solutions-
Your top-rated shield against malware and online scams | Avast Free AntivirusOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
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
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... -
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. Development takes place at https://github.com/zfoxer/AcoPath -
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... -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
vtrunkd
Network link bonding/trunking/aggregation and multichannel VPN daemon
vtrunkd - network link bonding and multichannel VPN. Vtrunkd is a Linux VPN daemon used to combine several connection paths into one aggregated channel. Features latency, reordering and jitter management, behaviour analysis optimizations for encapsulated protocols, bufferbloat control, packet redundancy, and multiple cpu cores utilization. Up to 30 heterogenous links bonding supported. Used for live streaming, LTE/3G/Wi-Fi link bonding. 32/64-bit, x86, MIPS and ARM supported. Supports python... -
6
Enhanced Stable Election Protocol- SEP-E
An enhanced stable election protocol for wireless sensor network
While wireless sensor networks are increasingly equipped to handle more complex functions, in-network processing may require these battery powered sensors to judiciously use their constrained energy to prolong the effective network life time especially in a heterogeneous settings. Clustered techniques have since been employed to optimize energy consumption in this energy constrained wireless sensor networks. We propose an Enhanced-SEP clustering algorithm in a three-tier node scenario...
- Previous
- You're on page 1
- Next
