Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithm
Search options not deleted
user 52620
An algorithm is a sequence of well-defined steps that define an abstract solution to a problem. Use this tag when your issue is related to algorithm design.
3
votes
1
answer
7k
views
Implementing a genetic algorithm to solve knapsack
I am trying to develop a genetic algorithm to solve knapsack problem(0-1). I am new to algorithm and programming as well. … private:
int popSize;
int maxB;
int maxW;
int bagWeight;
public:
std::default_random_engine dRandom;
};
#endif
implementation.cpp
#include <iostream>
#include <time.h>
#include <algorithm …
- 311
5
votes
2
answers
2k
views
Implementing a genetic algorithm to solve the Diophantine Equation
I am trying to implement a genetic algorithm to solve (Diophantine Equation).
For instance, a + 2b + 3c + 4d = 90 where a, b, c, d are positive integers. … #include<iostream>
#include <string>
#include <vector>
#include <time.h>
#include <algorithm>
using namespace std;
#define variable 4
#define chromoSize 100000
float total = 0;
struct Equation
{
int eq …
- 311