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 ds.algorithms
Search options not deleted
user 6242
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
3
votes
When are two algorithms said to be "similar"?
Very interesting question, and very nice paper Ryan!
I do definitely agree with the idea that making an assessment on the overall similarity between algorithms is mainly a subjective value judgement. …
2
votes
Do you know a shortest path algorithm for weighted graphs with hard time windows on the edge...
Unfortunately I am not aware of any complete and sound algorithm for solving this task. As far as I am aware, most techniques consist of Stochastic Local Search algorithms.
TSPTW (Traveling Salesman …
0
votes
0
answers
105
views
Are there any approaches to the following scheduling problem?
Consider the following problem: we are given $K$ tasks $\langle n_1, n_2, ..., n_K \rangle$. Every task $n_i$ is qualified with two parameters:
The time it takes to be completed ($t_i$) and,
The ut …