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 concurrency
Search options not deleted
user 47201
Concurrency is a property of systems in which several processes are executing at the same time.
1
vote
Collaborative graph exploration algorithm
Thanks a lot @Christophe for all your time and hard work answering my poorly asked question. You definitely deserve the bounty 👏
However, I've dug into the research papers and found that what I want …
- 41
2
votes
2
answers
346
views
Collaborative graph exploration algorithm
Given a minimum spanning tree in an unweighted graph of (10 .. 500) vertices and (vertice_count .. 1000) edges. Each vertex can have
up to 6 edges.
Given K agents/bots/processes/etc.., all starting fr …
- 41