Search Results for "bin packing algorithm c#"
Sort By:
Showing 20 open source projects for "bin packing algorithm c#"
View related business solutions-
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.
-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
1
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
.... OR-Tools is written in C++, but comes with wrappers for Python, C# and Java. Once you model your problem in your preferred programming language, you can then use any of OR-Tools’ available solvers. OR-Tools is an award-winning project, having won three gold medals in the 2020 MiniZinc Challenge, the international constraint programming competition. -
2
SecureDel
Secure File Deletion
SecureDel is a small utility that does not require installation and can be used directly from a USB drive. The program is very lightweight, very easy to use, very fast, and uses six different deletion algorithms. It does not leave any trace in the system where it acts and performs deletions in such a way that deleted files can no longer be recovered. It generates a report after each deletion to display the processing times. SecureDel 1.2.3 Released. Good Deletion! -
3
headsort
headsort: streaming sort + 2x faster than gnu sort
headsort sorts files by line and fields. Options can pick field order and etc. In general headsort can sort in 1/2 the time sort(1) (mergesort) does in situations involving either pipes or mult column selection; less than 1/2 with both. Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done... -
4
Pack-Print-Cut
Packing two dimensional rectangular elements at orthogonal table
Program was created for optimized packing of two dimensional rectangular elements at orthogonal table with main purpose of printing cutting sheets that can be used for cutting material at production in wood and panel furniture manufacturing. It is developed upon authors several years of experience at woodworking, and actual carpenters needs when such software is in question. In spite its look it is fully functional peace of software , with all necessary elements needed for generating cutting... -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
5
MaxBin2
An automatic tool for binning metagenomics sequences
MaxBin2 is the next-generation of MaxBin (https://sourceforge.net/projects/maxbin/) that supports multiple samples at the same time. MaxBin is a software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users could understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome... -
6
MaxBin
An automatic tool for binning metagenomics sequences
MaxBin is a software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users could understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome-related statistics, including estimated completeness, GC content and genome size in the binning summary page. Users could use MEGAN... -
7
Estimates the maximum random close packing fraction of hard spheres with a distribution of diameters, based upon an algorithm in J. Chem. Phys. 131, 244104 (2009).
-
8
Packery
Gapless, draggable grid layouts
Packery is a JavaScript library and jQuery plugin that makes gapless and draggable layouts. It uses a bin-packing algorithm to fill in empty gaps. Packery layouts can be intelligently ordered or organically wild. Elements can be stamped in place, fit in a specific spot, or dragged around. It’s perfect for draggable dashboard and seamless Masonry image galleries. If you want to use Packery to develop commercial sites, themes, projects, and applications, the Commercial license is the appropriate... -
9
Graphical representation for the 3D BIN PACKING problem using the algorithm (http://www.diku.dk/~pisinger/codes.html). Optimizes the volume of rectangular cubes inside a rectangular containers Displays the result in 3d graphics. Can be used on this website: http://www.3dbinbox.com
-
Secure remote access solution to your private network, in the cloud or on-prem.OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
-
10
Designed to help you with nonlinear, multidimensional, multi-parameter regression, using the Levenberg-Marquardt algorithm. The regression model can be set up using the input syntax of most modern cas. Full featured visualization and data edit mask. Regression Easy needs help. Especially need to catch exceptions and give reasonable error messages. (In the moment, the standard error handler is invoked. Simply click "resume" on any error.) For newest binary builds, look in the "/bin...
-
11
Paypal Slip Printer
Improve your packaging performance with Paypal Slip printer
It is simple tool to collect multiple packaging slips and print it in formatted way. Login to your Paypal account, select item which you would like to print, then open link "Print Packing Slip". When you see page loaded use select all combination (ctrl+a) and copy combination (ctrl+c). After that open Paypal Slip printer and paste your selection with ctrl+v and you are done. The software parses all the fields and prepares your slip. You can edit, print or save as PDF your formatted slips. Easy... -
12
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
13
chaos.sh
The breath of life for Artificial Intelligence.
... on random time. The system never knows the time when a programm ask chaos.sh and what comes back because chaos.sh is affected by system speed the quarz and other stuff. It´s fuzzy. ---new update chaos.sh.7z--- Uses now access time and no calculation of system time anymore, so it is smaller and faster. copy it to /usr/bin and give read and execute permission to make it accessible globally in the system for every script. You can use c=`sh chaos.sh` to get the chaosbit into your script. -
14
SpriteBuncher
A free, open-source texture packing program.
SpriteBuncher is a free, open-source texture packing program. It features an easy-to-use graphical interface, and advanced packing algorithms such as MaxRects. Further options include cropping, rotation, extruding, and padding. Data can be exported to a range of common output formats – e.g. Cocos2d, LibGDX, and Unity – or via generic XML, JSON, and plain text files. Examples and documentation are included. Source code available at: https://github.com/bazgt/SpriteBuncher [GPLv3]. -
15
GenNon-h
Simulating non-homogeneous multiple sequence alignments
... sequence alignments under the discrete-time Markov processes on phylogenetic trees, which samples directly from the transition matrices. Based on the input model and a phylogenetic tree in the Newick format (with branch lengths measured as the expected number of substitutions per site), the algorithm produces DNA alignments of desired length. GenNon-H is a collaborative project described at http://genome.crg.es/cgi-bin/phylo_mod_sel/AlgGenNonH.pl. -
16
-
17
This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
-
18
A simple desktop utility for putting the most amount of files onto a given set of CD/DVDs. Typically known as the Bin Packing or Knapsack problem.
-
19
This project is an attempt to solve 3D Bin Packing Problem. That is basically is packing a set number of boxes to ONE bin. User interface runs on OpenGL using 'Quantum energy' engine which is developed as part of this project.
-
20
This project aims at providing a set of tools for solving the class of monodimensional packing problems (such as cutting stock, bin packing and knapsack problem) mainly using genetic algoritms.
- Previous
- You're on page 1
- Next
