Hakuluettelo:
Käännös:
Canadian traveller problem (suomeksi)
- Määritelmät:
- (lb, en, comptheory) A generalization of the (w, shortest path problem) to graphs that are only partially observable (i.e. the graph is revealed while it is being explored).
Viimeisimmät haut: Canadian traveller problem, gang, round down, phosphine sulfide, lyophilisations, syvän punainen