Application to test a GA solution for the Knapsack problem, it will compare Genetic Algorithm solution of the Knapsack problem to greedy algorithm.
The algorithm of Karge Thompson is a heuristic algorithm that allows to obtain, given a specific group of jobs to be produced, the best sequence in terms of time setup.
N indipendent jobs;
the answer of an acm problem to further explantion look at source code.
This contribution provides functions for finding an optimum parameter set using the evolutionary algorithm of Differential Evolution. Simply speaking: If you have some complicated function of which you are unable to compute a derivative, and you...
In my following book, I derived the algorithm of constructing the parity check matrices of IEEE 802.16e LDPC.
 Y. Xiao, Turbo and LDPC Codecs and their Applications, Press of Posts and Telecommunications, Beijing, 2010.
A collection of M-Files that provide a succesful implementation of the difficult problem of numerical computation of multivariate normal probabilities. This is very useful for the distributed detection with nuisance parameters and in classical...
This code finds and plots the Pareto front of the following problem:
Find the smallest circle to enclose the largest no. of stars in a the following* space of stars.
*a space filled with a randomly positioned stars, so you will not...
A reimplementation of the CSSR algorithm of Shalizi et al. Extends the input data from discrete to continuous clustered by way of a novel discretisation scheme. Allows users to infer optimally predictive hidden Markov models from their data,...
This is a solution of Hermite interpolation problem.
A=[-1 2 -1 inf; 0 1 inf inf;1 -1 -1 8]
x f(x) f'(x) f''(x) . . .
-1 2 -1 Inf
0 1 Inf Inf
1 -1 -1 8
This is a simulation of Elevator (LIFT) problem. This project is coded entirely in C++ and using object oriented approach.
This function contains the well known greedy algorithm for solving Set Cover problem (ChvdodAtal, 1979), with two small modifications:
* In case of more than one possible choice at a certain step, the biggest set is chosen;
* Once the...
Program for global minimization of a concave function.
We implement the algorithm of Harold. P Benson which can be found in the
paper " A Branch and Bound-Outer Approximation Algorithm for Concave Minimization over a Convex...
Implementation of the algorithm proposed in the paper:
Morhac, M., 1991 - A Fast Algorithm of Nonlinear Volterra Filtering
Basically, the output of each n-homogeneous subsystem is decomposed into a summation of convolutions....
This is a small program that shows the diagram of C source that is similar to Flowchart.
This program may help the user analyze the algorithm of source.
HeliosFin is an object-oriented database and workspace, which is independent of any fieldnames, fieldlengths, and so on. Storing email-addresses, a football's diameter, or the proton number of beryllium? No problem!
Creating Webmaster's own website is much easier now-a-days than safeguarding it from the unauthorized intruders. Security becomes one of the major problem among the webmasters. This article bring a solution stating about Windows Authentication in...
Views Cloud allows you to build Web 2.0 style tag-clouds of any data retrieved by Views. Want to show a cloud of usernames weighted by age? Node titles weighted by number of reads? No problem. The module provides a 'standard' view style for custom...
treedb can implement malloc functionality, and much more!
Need a heap that allocates from a fixed size chunk of memory? No problem.
But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the memory...
meta-treedb can implement malloc functionality, and much more!
Need a heap that allocates of a fixed size chunk of memory? No problem.
But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the...