20 projects tagged "Optimization"
Updated 19 Apr 2013
PyDSM
| Pop | 123.83 |
|---|---|
| Vit | 3.32 |
PyDSM is a Python Delta Sigma Modulator toolbox. It contains tools for experimenting with ΔΣ modulators. It focuses mostly on experimentation with different techniques for the design of the modulator Noise Transfer Function (NTF) and simulation of a generic digital modulator.
Updated 15 Nov 2012
MOEA Framework
| Pop | 97.62 |
|---|---|
| Vit | 5.73 |
The MOEA Framework is a Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose optimization algorithms and metaheuristics. A number of algorithms are provided out-of-the-box, including NSGA-II, ε-MOEA, GDE3, and MOEA/D.
Updated 24 Oct 2011
CSS Import Resolver
| Pop | 21.75 |
|---|---|
| Vit | 1.00 |
CSS Import Resolver resolves the @import url(...); statements in input CSS files (by replacing the @import statement with the actual content of the linked CSS) and creates a huge CSS output (written to STDOUT by default). Including the combined CSS in your Web pages will improve the performance of a site by avoiding additional HTTP roundtrips.
Updated 11 Mar 2013
wro4j
| Pop | 179.16 |
|---|---|
| Vit | 11.56 |
wro4j is a project that will help you to easily improve your Web application page loading time. It can help you to keep your static resources (JavaScript and CSS) well organized, merge and minify them at run-time (using a simple filter) or build-time (using a Maven plugin), and has several features you may find useful when dealing with Web resources.
Updated 29 May 2011
kdiv
| Pop | 16.58 |
|---|---|
| Vit | 26.96 |
"kdiv" is a generator of routines for optimized division by an integer constant based on the work presented in H.S. Warren's "Hacker's Delight". "kdiv" can be used to emit a generic assembly or C implementation of signed or unsigned division.
Updated 28 May 2011
Evolving Objects
| Pop | 42.66 |
|---|---|
| Vit | 26.99 |
EO is a template-based, ANSI-C++ evolutionary computation library that helps you to write your own stochastic optimization algorithms quickly. Evolutionary algorithms form a family of algorithms inspired by the theory of evolution, and solve various problems. They evolve a set of solutions to a given problem in order to produce the best results. These are stochastic algorithms because they iteratively use random processes. The vast majority of these methods are used to solve optimization problems, and may be also called "metaheuristics". They are also ranked among computational intelligence methods, a domain close to artificial intelligence. With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems, from continuous to combinatorial ones.
Updated 14 Jun 2012
DAE Tools
| Pop | 53.85 |
|---|---|
| Vit | 3.02 |
DAE Tools is cross-platform equation-oriented process modelling, simulation, and optimization software. Various types of processes (lumped or distributed, steady-state or dynamic) can be modelled and optimized. They may range from very simple to those which require complex operating procedures. Equations can be ordinary or discontinuous, where discontinuities are automatically handled by the framework. Model reports containing all information about a model can be exported in XML MathML format, automatically creating high-quality documentation. The simulation results can be visualized, plotted, and/or exported into various formats.
Updated 28 Mar 2011
ca-ga
| Pop | 30.50 |
|---|---|
| Vit | 28.10 |
ca-ga is a toy artificial life simulation that uses genetic algorithms on large cellular automata. It uses simple but easily extended DNA that is 8k long by default, though you can take the size out to anything you have time to evolve. It sits under each cell of a 128x128 board and orders operations to transfer energy in the hopes of achieving a kill and breed. The simulation features a mutating fitness function, emergent sex, and a proof of concept real world fitness function. After enough generations, the cells or genes could achieve collectivism and organismhood, coordinating the values of the hotspots that determine board temperature in order to maintain a desired equilibrium. But maybe not. If you work in a fitness function, an optimizing problem solver results.
Updated 08 May 2011
HOPSPACK
| Pop | 23.87 |
|---|---|
| Vit | 1.45 |
HOPSPACK solves derivative-free optimization problems in a C++ software framework. The framework enables parallel operation using MPI (for distributed machine architectures) and multithreading (for single machines with multiple processors or cores). Optimization problems can be very general: functions can be noisy, nonsmooth, and nonconvex, linear and nonlinear constraints are supported, and variables may be continuous or integer-valued.
Updated 06 Apr 2012
AutoDiff.NET
| Pop | 39.31 |
|---|---|
| Vit | 3.71 |
AutoDiff.NET is a pure .NET library that allows a developer to easily compose functions symbolically and then automatically calculates the function's value and gradient at any given point. It can be very useful in conjunction with a gradients-based optimization library. It has been tested to work on Mono 2.10 on Linux and on .NET4 on Windows.
