20 projects tagged "Optimization"
Updated 18 May 2013
SLEEF
| Pop | 329.16 |
|---|---|
| Vit | 122.48 |
SLEEF (SIMD Library for Evaluating Elementary Functions) is a library that facilitates programming with SIMD instructions. It implements the trigonometric functions, inverse trigonometric functions, exponential and logarithmic functions in double precision without table look-ups, scattering from, or gathering into SIMD registers, or conditional branches. This library also includes some functions for evaluation in single precision.
Updated 14 Jul 2011
Traffic Squeezer
| Pop | 129.79 |
|---|---|
| Vit | 43.23 |
Traffic Squeezer is a Linux kernel based WAN network traffic accelerator from Doublefish Solutions. It uses methods such as traffic compression, traffic PDU coalescing, protocol specific acceleration (such as TCP acceleration mechanisms), and quality of service. Traffic Squeezer also contains custom L7filters (application protocol filters), DPI (Deep Packet Engines) and so on to control and administrate your traffic. With Traffic Squeezer, you can optimize MPLS,ISDN, leased links, Satellite Networks, and Marine Internet, and even build your own custom WAN Appliance with Traffic Squeezer. A GUI is now supported via Doublefish Solution Aquarium. Aquarium is a Web-GUI that also supports Traffic Squeezer, Squid, and other open source solutions.
Updated 07 May 2009
Japplis Website Optimizer Lite
| Pop | 27.09 |
|---|---|
| Vit | 38.37 |
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 | 26.13 |
|---|---|
| Vit | 36.80 |
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 28 Mar 2011
ca-ga
| Pop | 30.82 |
|---|---|
| Vit | 28.00 |
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 28 May 2011
Evolving Objects
| Pop | 43.13 |
|---|---|
| Vit | 26.88 |
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 29 May 2011
kdiv
| Pop | 16.67 |
|---|---|
| Vit | 26.85 |
"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 29 Feb 2012
CacheGuard Web Security Gateway
| Pop | 239.14 |
|---|---|
| Vit | 18.79 |
CacheGuard Appliance is an all-in-one OS appliance providing firewall, antivirus, caching, compression, bandwidth allocation, load balancing, reverse and forward proxy, high availability, Web application firewall, URL guarding, and more. It can be purchased as an OS to install on your server, as an OS to run in a virtual machine, or as a hardware appliance.
Updated 11 Mar 2013
wro4j
| Pop | 180.23 |
|---|---|
| Vit | 12.00 |
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 20 Jul 2012
NLopt
| Pop | 114.53 |
|---|---|
| Vit | 6.17 |
NLopt is a library for nonlinear optimization that allows one to select from a wide variety of optimization algorithms by changing a single parameter. Its features include both local and global optimization, unconstrained, bound-constrained, or nonlinear-inequality constrained problems, and optimization using function values only or using derivatives if they are available. It was initially begun as a wrapper around several existing optimization packages, but it now also includes original implementations of several algorithms for which no free code was available. It provides interfaces callable from C/C++, Fortran, Matlab, GNU Octave, Python, and GNU Guile.
