A carregar...
QUICK SEARCH OF The shortest paths on the graph WITH A PREDETERMINED DECISION
On the classical problem of searching the shortest paths in graphs considered the possibility of accelerating the search procedure by incorporating a priori information about the search space. Global initialization of state variables predefined search and selection solutions can improve performance...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Russo |
| Publicado em: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-06-01
|
| Colecção: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Assuntos: | |
| Acesso em linha: | https://doklady.bsuir.by/jour/article/view/328 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|