Data Structures Jobs

2 were found based on your criteria

  • Fixed-Price – Est. Budget: $60.00 Posted
    You will implement a genetic algorithm to find solutions to the knapsack problem. The general idea is based on the paper “Solving the 0-1 Knapsack Problem with Genetic Algorithms” by Maya Hristakeva and Dipti Shrestha, which is available on MU Online. Your algorithm will be a little easier than theirs. It will have these properties: 1. Roulette-wheel selection only (not group selection) 2. Crossover 3. Mutation 4. No use of elitism 5. Your code will run for a fixed number ...
  • Fixed-Price – Est. Budget: $150.00 Posted
    We require a talend job to be created that takes an XML documents from one location and maps it to a different schema and outputs to another location. We will also require a UNIX command flag that points to a config file that contains job variables. This is all explained in the job spec document that I will send the successful candidate.