Algorithm Of Dijkstra
Mostrando 1-9 de 9 artigos, teses e dissertações.
-
1. Mine fleet cost evaluation - Dijkstra's optimized path
Abstract The transport distance in a mining operation strongly influences a mine operation revenue and its operational cycle because it is a fundamental part of the total mining costs. Generally, the transport route is determined based on an engineer's practical knowledge, which does not consider any mechanism to optimize the possible routes to be taken. In
REM, Int. Eng. J.. Publicado em: 2019-06
-
2. Spectrum Continuity and Contiguity based Dedicated Protection for Flexible Optical Networks
Abstract Elastic optical networks (EONs) have been pointed out as a promising candidate for transporting data with high transmission rates in adaptive optical networks. Consequently, the occurrence of a failure in a simple element may cause the interruption of various services. Survival mechanisms have been crucial to try to overcome the problems created by
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2017-04
-
3. GERAÇÃO PROCEDURAL DE CENÁRIOS 3D DE CÂNIONS COM FOCO EM JOGOS DIGITAIS / GERAÇÃO PROCEDURAL DE CENÁRIOS 3D DE CÂNIONS COM FOCO EM JOGOS DIGITAIS / PROCEDURAL GENERATION OF 3D SCENES FEATURING CANYONS FOCUSED ON DIGITAL GAMES / PROCEDURAL GENERATION OF 3D SCENES FEATURING CANYONS FOCUSED ON DIGITAL GAMES
Esta dissertação propõe um método procedural não assistido, baseado em técnicas de computação gráfica, visão computacional e busca em grafos, para a geração de cenários 3D de cânions com foco em jogos digitais. Para definir as características a serem reproduzidas, foram analisadas diversas imagens de cânions reais chegando-se em dois modelos,
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 05/03/2012
-
4. Heurísticas e algoritmos evolutivos para formulações mono e multiobjetivo do problema do roteamento multicast
Neste trabalho são investigados modelos evolutivos aplicados ao Problema do Roteamento Multicast (PRM), cujo objetivo é calcular árvores multicast a partir de um grafo conectado ponderado, otimizando uma ou mais funções objetivo relacionadas a requisitos de Qualidade de Serviço e Engenharia de Tráfego. O PRM pode ser visto como uma extens ão ao conhe
Publicado em: 2010
-
5. GeraÃÃo de fraturas auto-similares em meios desordenados: tÃcnicas do caminho crÃtico e do caminho mÃnimo. / Generating self-similar fractures in disordered media: techniques of critical path and the minimal path.
Neste trabalho propomos dois modelos para a geraÃÃo de fraturas em substratos regulares. No primeiro modelo, empregamos iterativamente o conceito de caminho crÃtico para determinar sistematicamente o elemento de menor âcondutividadeâ da rede. Estes elementos sÃo entÃo identificados como âfalhasâ e removidos permanentemente da estrutura atà que uma
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 21/07/2008
-
6. Engenharia de tráfego entre domínios de redes distintas
This work intends to perform end-to-end traffic engineering through simulations in broadband multiprotocol networks and evaluate used parameters. Weve proposed and tested parameters used by the network administrator to dimension the action of an algorithm for Traffic Engineering. We dedicated special attention to IP networks interconnected to MPLS networks.
Publicado em: 2007
-
7. Problemas de proximidade e de caminhos minimos em superficies poliedricas
Shortest Path Planning is the field of Computational Geometry that concerns the determination of feasible shortest paths from a point to another in a given environment. We deal with a directed shortest path problem (DFGP) that minimizes the total work spent to move a body on a polyhedral surface with constant friction coefficient and constant slope in each f
Publicado em: 1998
-
8. Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. The scheme relies on an upwind finite difference approximation to the gradient and a resulting causality relationship that lends itself to a Dijkstra-like programming approach. In
The National Academy of Sciences.
-
9. Fast-phase space computation of multiple arrivals
We present a fast, general computational technique for computing the phase-space solution of static Hamilton–Jacobi equations. Starting with the Liouville formulation of the characteristic equations, we derive “Escape Equations” which are static, time-independent Eulerian PDEs. They represent all arrivals to the given boundary from all possible startin
The National Academy of Sciences.