Search Results for "binary differential evolution"
Sort By:
18 projects for "binary differential evolution" with 1 filter applied:
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
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.
-
1
DEEP
Differential Evolution Entirely Parallel Method
The Differential Evolution, introduced in 1995 by Storn and Price, considers the population, that is divided into branches, one per computational node. The Differential Evolution Entirely Parallel method takes into account the individual age, that is defined as the number of iterations the individual survived without changes. The introduced improvements are: (I) allow several oldest individuals to be overwritten by the same number of best ones in the population, (II) new selection rule uses several objective functions in offspring evaluation. ... -
2
evTools
Tools to analyse output from the stellar-evolution code ev/STARS/TWIN
The evTools package provides tools to manipulate and display output from the binary stellar-evolution code ev (also known as STARS and TWIN). -
3
DAR - Disk ARchive
For full, incremental, compressed and encrypted backups or archives
DAR is a command-line backup and archiving tool that uses selective compression (not compressing already compressed files), strong encryption, may split an archive in different files of given size and provides on-fly hashing, supports differential backup with or without binary delta, ftp and sftp protocols to remote cloud storage Archive internal's catalog, allows very quick restoration even a single file from a huge, eventually sliced, compressed, encrypted archive eventually located on a remote cloud storage, by only reading/fetching the necessary data to perform the operation. ... -
4
Fosite - advection problem solver
numerical simulation code for solving transport equations in 1D/2D/3D
Fosite is a generic framework for the numerical solution of hyperbolic conservation laws in generalized orthogonal coordinates. Its main purpose is the simulation of compressible flows in accretion disks. The underlying numerical solution method belongs to the family of unsplit conservative finite volume TVD schemes. The method is 2nd order accurate in space and uses high order Runge-Kutta and multistep schemes for time evolution. In addition to the pure advection code several source terms... -
PRTG Catches Network Issues Before They Cause DowntimeReactive troubleshooting usually means hearing about a problem from frustrated users, not your monitoring tool. PRTG sets threshold-based alerts across devices, servers and applications, notifying your team by email, SMS or push the moment a metric crosses a set limit. That means catching a failing disk or overloaded server before it becomes an outage and getting time back from firefighting. Start a free trial and set your first alerts today.
-
5
The ASCO project aims to bring circuit optimization capabilities to existing SPICE simulators using a high-performance parallel differential evolution (DE) optimization algorithm. It supports Eldo, HSPICE, LTspice, Spectre, and Qucs.
-
6
scikit-opt
Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing
scikit-opt is a Python library for solving optimization problems with evolutionary and swarm-intelligence algorithms. It includes genetic algorithms, particle swarm optimization, differential evolution, simulated annealing, ant colony optimization, immune algorithms, and artificial fish swarms. The package can address continuous objectives, constrained problems, and combinatorial tasks such as the traveling salesman problem. A consistent workflow lets users define an objective, configure an optimizer, run iterations, and inspect the best solution. ... -
7
diffpak
A huge files block differential compressor
A differential compresor (or a binary diff) for huge files. Unlike other tools, e.g. xdelta3, it searches for matching data through the whole source file, even if it weights several gigabytes, while using much less memory (with default configuration approx 25x less than the size of the source file). Output files are not compressed, so you can use any compressor you like with great results. -
8
American Fuzzy Lop
American fuzzy lop - a security-oriented fuzzer
AFL (American Fuzzy Lop) is a widely used graybox fuzzer that discovers bugs by mutating inputs and steering execution using lightweight instrumentation. Instead of random mutations alone, it uses coverage feedback to evolve input corpora, pushing programs into deeper and more interesting code paths. Its workflow emphasizes quick start: point it at a target binary with compile-time instrumentation (or use QEMU-based mode when recompilation isn’t possible), seed it with a small corpus, and... -
9
OpenDino
Open Source Java platform for Optimization, DoE, and Learning.
...It provides a graphical user interface (GUI) and a platform which simplifies integration of new algorithms as "Modules". Implemented Modules Evolutionary Algorithms: - CMA-ES - (1+1)-ES - Differential Evolution Deterministic optimization algorithm: - SIMPLEX Learning: - a simple Artificial Neural Net Optimization problems: - test functions - interface for executing other programs (solvers) - parallel execution of problems - distributed execution of problems via socket connection between computers Others: - data storage - data analyser and viewer -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. ... -
11
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary meta-heuristic optimization algorithms. For this purpose, Opt4J relies on a module-based implementation and offers a graphical user interface for the configuration as well as a visualization of the optimization process. -
12
DE-HEoC
DE-based Weight Optimisation for Heterogeneous Ensemble
We propose the use of Differential Evolution algorithm for the weight adjustment of base classifiers used in weighted voting heterogeneous ensemble of classifier. Average Matthews Correlation Coefficient (MCC) score, calculated over 10-fold cross-validation, has been used as the measure of quality of an ensemble. DE/rand/1/bin algorithm has been utilised to maximize the average MCC score calculated using 10-fold cross-validation on training dataset. -
13
rochePlot
Schematically plot the evolution of binary stars
RochePlot is a Fortran code using PGPlot to plot a series of binaries to illustrate the key stages in the evolution of a binary star -
14
MOEA Framework
A Free and Open Source Java Framework for Multiobjective Optimization
The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA Framework provides the tools necessary to rapidly design, develop, execute and statistically test optimization algorithms. -
15
EmulMultiFit
Simultaneously fit SAS data with polydisperse core-shell-shell spheres
Keywords: -simultaneously fit several SAXS and SANS data sets with polydisperse (Schultz-Zimm or Gaussian distribution f(R)) spherical core-shell-shell nanoparticles -analytical expressions are used for from factor F(Q) and its integral over f(R), no numerical integration required -absolute units -Mathematica is required via console (MathKernel) -Mathematica's local and global optimizers (simulated annealing, differential evolution, Nelder-Mead, ...) can be used -range for fit parameters and further constraints between fit parameters are possible -Monodisperse(!) hard sphere structure factor can be used, too -long computation times (depending on problem size and amount of constraints) from hours to a few days are possible -non-parallelized code -
16
XNDiff
X-ray and Neutron powder pattern simulation analysis
Keywords (XNDiff): -SAXS -SANS -absolute units -core (double)shell crystalline nanoparticles -with a parallelepidal shape -particle assemblies -powder and ensemble average -C/C++ -Unix -OpenMP -HPC Cluster Keywords (BatchMultiFit): -simultaneous fits for several SAXS and SANS curves with simulation data from XNDiff -SANS data can be smeared with dq values from experimental data sets or analytical functions -Mathematica console -local and global optimizers (simulated annealing, differential evolution, Nelder-Mead, ...) can be used -range for fit parameters and further constraints between fit parameters -parallelized (typ. 4-8 threads) TODO (BatchMultiFit): -read and use errorbars from experimental data sets -allow different q-ranges for different data sets in the fits -rewrite and test in Python using e.g. the lmfit module: https://pypi.python.org/pypi/lmfit/ to get rid of Mathematica and to run it on HPC clusters -
17
This is a GUI, Java implementation of the Ant Colony Optimisation/Particle Swarm Optimisation (PSO/ACO2) rule induction algorithm. This project was inspired by Ant-Miner, but handles continuous attributes using PSO or now Differential Evolution.
-
18
Binary package of Ximian (Novell) Evolution (X11 version) for Mac OS X, with native Mac OS X installer.
- Previous
- You're on page 1
- Next
