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 algorithms
Search options not deleted
user 9022
Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.
7
votes
Are there ill-conditioned problems in infinite precision arithmetric?
It's worth pointing out that many inverse problems in the functional analytic setting go beyond ill-conditioning to ill-posedness. That is, a small change in the data (noise) can lead to an aribtrari …
- 3,934
3
votes
Accepted
definition of "exact neighborhood" [optimization]
It's important that you understand the definition of a neighborhood used in this book. This is definition 1.3 on page 7. $N$ is not a set but rather a function that maps a solution to the problem to …
- 3,934
2
votes
Greedy approach to 0-1 Knapsack problem in specific instances
As Frederico has already shown, this isn't enough to make the greedy heuristic immune to counterexamples.
It's worth mentioning that there is a simple dynamic programming algorithm for the knapsack …
- 3,934
1
vote
QUBO formulation of a discrete-variable Genetic Algorithm optimization problem
The binary encoding trick requires you to actually bound the $N$ parameters. Suppose that $m$ bits suffice for each of the $N$ parameters. Then you have $L=2^{mN}$ bits in your QUBO. Even then, you …
- 3,934