Search Results for "genetic algorithm c"
Sort By:
Showing 23 open source projects for "genetic algorithm c"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
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
Bit-Twist (Packet generator/editor)
Packet generator and packet editor for Windows, Linux, BSD, and macOS
Supported systems: Windows, Linux, BSD, and macOS. Bit-Twist is a simple yet powerful libpcap-based Ethernet packet generator and packet editor. It is designed to complement tcpdump, which by itself has done a great job at capturing network traffic. With Bit-Twist, you can now regenerate your captured traffic onto a live network! Packets are generated from tcpdump trace file (.pcap file). Bit-Twist comes with a comprehensive trace file editor to allow you to change the contents of a... -
2
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 -
3
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... -
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... -
Level Up Your Cyber Defense with External Threat ManagementMove beyond alerts. Gain full visibility, context, and control over your external attack surface to stay ahead of every threat.
-
5
MCU Media Server
SIP Video Multiconference Media Server with WebRTC support.
REPOSITORY MOVED TO GITHUB!! https://github.com/medooze/media-server Video Multiconference Media Server with WebRTC support. Provide Multiconference and video broadcasting services to any SIP service. Supports VP8, H264, MP4V-ES, H263 and H263P, continuous presence, RTMP flash broadcasting, adhoc conferences, load balancing and administrative WEB interface. JSR309 driver implementation under development. . -
6
NiceShaper - Dynamic Traffic Shaper
NiceShaper provides dynamic traffic shaping for Linux router
NiceShaper is the program developed for Linux router environment. It works in user space on top of standard Linux QOS implementation and iptables. By default, a proven HTB algorithm is used for the root, inner, and leaf classes, SFQ packets scheduling algorithm is the default queuing discipline (qdisc) contained within each of leaf classes, U32 and FW are used as the packets classifiers. NiceShaper provides dynamic traffic shaping approach which is more effective than traditional shaping... -
7
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... -
8
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. ... -
9
Online XOR Coding
Online XOR packet coding BENEFIT
The project page provides the source code of custom built simulators used in our publications whose URL are given as follow: http://dx.doi.org/10.1016/j.comcom.2013.09.006 http://dx.doi.org/10.1109/PIMRC.2009.5449983 The titles of the papers are: Online XOR packet coding: Efficient single-hop wireless multicasting with low decoding delay (COMCOM VERSION). An efficient network coding based retransmission algorithm for wireless multicast (PIMRC VERSION). Help (README) files... -
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
10
This Netfilter module implements the IVI translation algorithm. IVI is a stateless way to provide a bridge between the IPv6 world and the IPv4 world. More information here: http://datatracker.ietf.org/doc/rfc6219/ You need DNS64 to get this work
-
11
We implement a new IP address auto-configuration mechanism for MANET. The proposed mechanism lets any nodes in a MANET distribute address pools to a new node. The proposed algorithm can guarantee address uniqueness and achieve fast address assignment
-
12
-
13
A proof-of-concept application of the Statistical Protocol IDentification (SPID) algorithm. SPID can detect the application layer protocol (layer 7) by analysing flow (packet sizes etc.) and payload statistics (byte values etc.) from pcap files.
-
14
libconhash is a consistent hashing libraray, which can be compiled both on Windows and Linux platform. High performance, easy to use, and easy to scale according to node's processing capacity.
-
15
The load robin-robin algorithm directs network connections to different real servers based on server weights in a round-robin manner. This case the weights are update in real time and it is based in the loads real servers monitored for the director.
-
16
iptables-TNG ( The Next Generation of iptables) An environment that can use different packet classification algorithm (eg. tuple) to support large rulesets (more than 10,000 rules) for high bandwidth networks.
-
17
pumipd is a daemon for dynamic configuration of IPv4 addresses. A static DHCP-Server is not necessary, the complete algorithm is dynamic. umipd is intended to be a conformant implementation of RFC 3927 (Zeroconf).
-
18
nf-HiPAC is a high performance packet filter for Linux. It provides the same rich feature set as iptables but uses an advanced algorithm to minimize the number of memory lookups per packet.
-
19
The Optimized Link State Routing (RFC 3626) is an optimization of the classical link state algorithm for wireless Mobile Ad-hoc Networks (MANETs). Quagga is a popular routing software suite. This project is about making an OLSR implementation for Quagga.
-
20
Flying Ants implements a wireless ad-hoc routing algorithm based upon biologically inspired ant-like agents. The code is suitable for single board computer systems (e.g., soekris boards). It runs in userland and utilizes a threaded raw socket protocol.
-
21
It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.
-
22
The objective of this project is to provide an optimized TCP/IP stack by eliminating the data copying at the socket interface and implementing a feedback-based adaptive rate-based flow control algorithm to maximize the network bandwidth utilization.
-
23
rproxy integrates rsync and HTTP, and provides a way to significantly reduce network bandwidth usage. The rsync algorithm allows for client or proxy caching of all content, not just static content.
- Previous
- You're on page 1
- Next
