Search Results for "genetic algorithm software" - Page 2
Sort By:
Showing 1189 open source projects for "genetic algorithm software"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
1
Homemade Machine Learning
Python examples of popular machine learning algorithms
homemade-machine-learning is a repository by Oleksii Trekhleb containing Python implementations of classic machine-learning algorithms done “from scratch”, meaning you don’t rely heavily on high-level libraries but instead write the logic yourself to deepen understanding. Each algorithm is accompanied by mathematical explanations, visualizations (often via Jupyter notebooks), and interactive demos so you can tweak parameters, data, and observe outcomes in real time. The purpose is... -
2
Caire
Content aware image resize library
Caire is a content aware image resize library based on Seam Carving for Content-Aware Image Resizing paper. An energy map (edge detection) is generated from the provided image. The algorithm tries to find the least important parts of the image taking into account the lowest energy values. Using a dynamic programming approach the algorithm will generate individual seams across the image from top to down, or from left to right (depending on the horizontal or vertical resizing) and will... -
3
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
4
LeetCode Master
About "Code Thoughts" LeetCode Practice Guide: 200 classic questions
leetcode-master is a comprehensive collection of LeetCode solutions written in C++ and organized as a structured learning path for coding interview preparation. The repository contains detailed explanations, categorized problem sets, and step-by-step reasoning behind solutions, making it an effective study companion for developers preparing for technical interviews. Problems are grouped by topic—such as arrays, linked lists, dynamic programming, greedy algorithms, and graph theory—so... -
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
5
gse
Go efficient multilingual NLP and text segmentation
Go efficient multilingual NLP and text segmentation; support English, Chinese, Japanese and others. Gse is implements jieba by golang, and try add NLP support and more feature. Support common, search engine, full mode, precise mode and HMM mode multiple word segmentation modes. Support user and embed dictionary, Part-of-speech/POS tagging, analyze segment info, stop and trim words. Support multilingual: English, Chinese, Japanese and others. Support Traditional Chinese. Support HMM cut text... -
6
nghttp2
HTTP/2 C Library and tools
nghttp2 is an implementation of HTTP/2 and its header compression algorithm HPACK in C. The framing layer of HTTP/2 is implemented as a form of reusable C library. On top of that, we have implemented HTTP/2 client, server and proxy. We have also developed a load test and benchmarking tool for HTTP/2. We have participated in httpbis working group since HTTP/2 draft-04, which is the first implementation draft. Since then we have updated nghttp2 library constantly to the latest specification... -
7
KACTL
KTH algorithm competition template library
KACTL (the KTH Algorithmic Contest Template Library) is an extensively curated and high-performance C++ algorithms library created by the competitive programming team at the Royal Institute of Technology (KTH) to serve as a trusted, battle-tested codebase for algorithmic contests, programming competitions, and general algorithm development. The repository aggregates dozens of concise implementations of essential data structures, numerical methods, graph algorithms, string processing tools,... -
8
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms. -
9
MCScanX
MCScanX: Multiple Collinearity Scan toolkit X version
MCScanX is a toolkit for detecting gene synteny and collinearity, aiding in the evolutionary analysis of gene arrangements across multiple genomes. It extends the original MCScan algorithm by incorporating additional utilities for visualization and downstream analyses. -
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.
-
10
TextDistance
Compute distance between sequences
Python library for comparing the distance between two or more sequences by many algorithms. For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). TextDistance show benchmarks... -
11
Eagleye
Precise localization based on GNSS and IMU
Eagleye is an open-source software for vehicle localization utilizing GNSS and IMU[1]. Eagleye provides highly accurate and stable vehicle position and orientation by using GNSS Doppler[2][3][4][5][6]. The flowchart of the algorithm is shown in the figure below. The algorithms in this software are based on the outcome of the research undertaken by the Machinery Information Systems Lab (Meguro Lab) at Meijo University. -
12
OpenSSL-for-iOS
A script for compiling OpenSSL for iOS Devices
This is a script for using self-compiled builds of the OpenSSL-library on the iPhone. You can build apps with Xcode and the official SDK from Apple with this. I also made a small example app for using the libraries with Xcode and the iPhone/iPhone Simulator. This repository contains an iOS 15.0 Xcode Project which uses the OpenSSL Libraries. The examples uses the MD5 or SHA256-algorithm to calculate an md5 or sha256 hash from an UITextfield. iOS 12.0 - iOS 16.2 (x86_64 , arm64, arm64e... -
13
International Components for Unicode
The home of the ICU project source code
ICU is a mature, widely used set of C/C++ and Java libraries providing Unicode and Globalization support for software applications. ICU is widely portable and gives applications the same results on all platforms and between C/C++ and Java software. ICU is released under a nonrestrictive open-source license that is suitable for use with both commercial software and with other open-source or free software. Convert text data to or from Unicode and nearly any other character set or encoding. ... -
14
InterviewGuide
Repository that collects extensive computer science
InterviewGuide is a widely-starred open-source repository that collects extensive computer science learning notes, interview preparation materials, and job search strategies aimed especially at students and early-career developers. It was created by a developer who documented his own journey from campus to tech industry, including detailed learning pathways for languages like C/C++, Go, JavaScript, and frameworks like Vue, as well as topics such as operating systems, networks, databases, and... -
15
BQSKit
Berkeley Quantum Synthesis Toolkit
The Berkeley Quantum Synthesis Toolkit (BQSKit) [bis • kit] is a powerful and portable quantum compiler framework. It can be used with ease to compile quantum programs to efficient physical circuits for any QPU. A standard workflow utilizing BQSKit consists of loading a program into the framework, modeling the target QPU, compiling the program, and exporting the resulting circuit. -
16
Pythonic Data Structures and Algorithms
Minimal examples of data structures and algorithms in Python
The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on... -
17
ngraph.path
Path finding in a graph
ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to... -
18
DualPipe
A bidirectional pipeline parallelism algorithm
DualPipe is a bidirectional pipeline parallelism algorithm open-sourced by DeepSeek, introduced in their DeepSeek-V3 technical framework. The main goal of DualPipe is to maximize overlap between computation and communication phases during distributed training, thus reducing idle GPU time (i.e. “pipeline bubbles”) and improving cluster efficiency. Traditional pipeline parallelism methods (e.g. 1F1B or staggered pipelining) leave gaps because forward and backward phases can’t fully overlap... -
19
A QUIC implementation in pure Go
A QUIC implementation in pure go
quic-go is an implementation of the QUIC protocol, RFC 9000 protocol in Go. In addition to RFC 9000, it currently implements the IETF QUIC draft-29. Support for draft-29 will eventually be dropped, as it is phased out of the ecosystem. We currently support Go 1.16.x and Go 1.17.x. See the example server. Starting a QUIC server is very similar to the standard lib http in go. Also, check out the example client. Use a http3.RoundTripper as a Transport in a http.Client. QUIC includes security... -
20
SponsorBlock
Skip YouTube video sponsors (browser extension)
SponsorBlock is an open-source crowdsourced browser extension and open API for skipping sponsor segments in YouTube videos. Users submit when a sponsor happens from the extension, and the extension automatically skips sponsors it knows about using a privacy-preserving query system. It also supports skipping other categories, such as intros, outros, and reminders to subscribe, and skipping to the point with highlights. The extension also features an upvote/downvote system with a weighted... -
21
Delta
A viewer for git and diff output
Code evolves, and we all spend time studying diffs. Delta aims to make this both efficient and enjoyable: it allows you to make extensive changes to the layout and styling of diffs, as well as allowing you to stay arbitrarily close to the default git/diff output. Language syntax highlighting with color themes. Within-line highlights based on a Levenshtein edit inference algorithm. Git style strings (foreground color, background color, font attributes) are supported for >20 stylable elements.... -
22
Random Cut Forest by AWS
An implementation of the Random Cut Forest data structure
This repository contains implementations of the Random Cut Forest (RCF) probabilistic data structure. RCFs were originally developed at Amazon to use in a nonparametric anomaly detection algorithm for streaming data. Later new algorithms based on RCFs were developed for density estimation, imputation, and forecasting. The different directories correspond to equivalent implementations in different languages, and bindings to to those base implementations, using language-specific features for... -
23
miso
A tasty Haskell front-end framework
Miso is a small, production-ready, "isomorphic" Haskell front-end framework for quickly building highly interactive single-page web applications. It features a virtual-dom, recursive diffing / patching algorithm, attribute and property normalization, event delegation, event batching, SVG, Server-sent events, Websockets, type-safe servant-style routing and an extensible Subscription-based subsystem. Inspired by Elm, Redux and Bobril. Miso is pure by default, but side effects (like XHR) can be... -
24
carbone
Fast and simple report generator, from JSON to pdf, xslx, docx, odt
Turn your JSON into PDF, DOCX, XLSX, PPTX, ODS and many more. Fast, Simple and Powerful report generator in any format PDF, DOCX, XLSX, ODT, PPTX, ODS, XML, CSV using templates and your JSON data as input. -
25
core.match
An optimized pattern matching library for Clojure
core.match is a high-performance pattern-matching library for Clojure and ClojureScript. It provides an optimized macro-based DSL for structurally matching data—such as sequences, maps, regexes—offering a clearer alternative to nested conditionals or destructuring. A symbol pattern can represent one of three behaviours. Match the value of an existing local binding. Create a "named" wildcard pattern that creates a binding of the given name to the right of the pattern row.
