A search problem on a bipartite network (Q1735184)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A search problem on a bipartite network |
scientific article; zbMATH DE number 7043899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A search problem on a bipartite network |
scientific article; zbMATH DE number 7043899 |
Statements
A search problem on a bipartite network (English)
0 references
28 March 2019
0 references
applied probability
0 references
optimal search strategy
0 references
minimum expected search cost
0 references
existence probability
0 references
moving and search costs
0 references
0 references
0 references
0.8240354657173157
0 references
0.8047714233398438
0 references
0.7982792854309082
0 references
0.77919602394104
0 references
0.7791603207588196
0 references
