Search Results for "benchmark"

...For students preparing for technical interviews, self-learners brushing up on fundamentals, or developers wanting to understand algorithm internals, this repository provides ready-to-run examples, and can serve as a sandbox to experiment, benchmark, or adapt code. Because it’s in pure Python, it’s easy to read and modify, making it accessible even to those with modest programming experience. The repo helps bridge the gap between theoretical algorithm descriptions and real-world code, giving concrete, working implementations that one can study, debug, or extend.

I was curious how much better the Algorithms, pointed out by BitTwiddling Hacks, perform than a simple Lookup Table approach... Now I think, perhaps my little investigation is interesting for others too... PS: the parallel counting Algo is about 35% faster on average on my computers than a simple LUT based solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-) In the meantime I added other Algorithms beside...

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...

Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.

Currently two way astar is implemented. For those interested I have uploaded a patch of this for pgrouting v1.05 moved to https://github.com/sroycode/tway

...Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments demonstrate that the proposed method performs promisingly for well-known benchmark problems in the term of optimization accuracy.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

This CPU Benchmark is written in .NET C# and use the Linpack and Whetstone algorithm.

OpenDiscreteDynamicProgrammingTemplate : founds optimal constrainted parameters of a discrete controls with second order optimization template replacing Hessian with directional derivatives and backpropagation for digital filter(as neural network)

Sorting algorithm performance testing using a generic test interface

Evolutionary computation library and benchmark utility. Integer encoded genetic algorithm.