9 projects tagged "Optimization"
Updated 15 Nov 2012
MOEA Framework
| Pop | 97.47 |
|---|---|
| Vit | 5.76 |
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 19 Apr 2011
Orc
| Pop | 59.75 |
|---|---|
| Vit | 1.42 |
Orc is a library and set of tools for compiling and executing very simple programs that operate on arrays of data. The "language" is a generic assembly language that represents many of the features available in SIMD architectures, including saturated addition and subtraction, and many arithmetic operations.
Updated 14 Jun 2012
DAE Tools
| Pop | 53.53 |
|---|---|
| Vit | 3.03 |
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 May 2011
Evolving Objects
| Pop | 42.80 |
|---|---|
| Vit | 26.93 |
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 17 Feb 2010
JCGO
| Pop | 41.28 |
|---|---|
| Vit | 34.49 |
JCGO (pronounced as "j-c-go") translates (converts) programs written in Java into platform-independent C code that can be compiled (by third-party tools) into highly-optimized native code for the target platform. JCGO is a powerful solution that enables your desktop, server-side, embedded, mobile, and wireless Java applications to take full advantage of the underlying hardware. In addition, JCGO makes your programs, when compiled to native code, as hard to reverse engineer as if they were written in C/C++. The JCGO translator uses some optimization algorithms that allow, together with optimizations performed by a C compiler, the resulting executable code to reach better performance compared with the traditional Java implementations (based on the Just-In-Time technology). The produced executable does not contain nor require a Java Virtual Machine to execute, so its resource requirements are smaller than that required by a typical Java VM. This also simplifies the process of deployment and distribution of an application.
Updated 07 May 2009
Japplis Website Optimizer
| Pop | 40.60 |
|---|---|
| Vit | 1.02 |
Japplis Website Optimizer is a tool that can reduce the size of your Web pages, CSS, and Javascript by more than 50% using several techniques. This will not only make your Web site faster but also save bandwidth. It can also add the height, width, and alt attribute to the images if missing. It can generate an .htaccess file to improve the caching of the server.
Updated 07 May 2009
Japplis Website Optimizer Lite
| Pop | 26.93 |
|---|---|
| Vit | 38.41 |
Japplis Website Optimizer Lite is a program to optimize your Web pages. Using several techniques, it can reduce the size of your HTML pages by more than half. This will not only make your Web site faster, but also save bandwidth. Japplis Website Optimizer Lite can also add the height, width, and alt attributes to images if they are missing.
Updated 02 Sep 2009
Python Simulated Annealing Module
| Pop | 25.90 |
|---|---|
| Vit | 36.84 |
Simulated annealing is a computational algorithm for optimization. It mimics the physical process of thermal annealing in which a metal is heated and then slowly cooled to settle into a highly ordered crystal structure. For common metals, the lowest energy state is already known. But the method is useful for other problems where the best state is not known and exhaustively searching all possible states is impractical. The method is applied by modeling the problem as a physical system with structure, energy, and temperature. This Python module implements simulated annealing so that it can be easily applied to a variety of problems. An example program is include to perform simulated annealing of the traveling salesman problem.
Updated 08 May 2011
HOPSPACK
| Pop | 24.02 |
|---|---|
| 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.
