14   Artículos

 
en línea
Jeong-Seok Lee, Tae-Hoon Kim and Yong-Gil Park    
The increase in maritime traffic and vessel size has strengthened the need for economical and safe maritime transportation networks. Currently, ship path planning is based on past experience and shortest route usage. However, the increasing complexity of... ver más
Revista: Journal of Marine Science and Engineering    Formato: Electrónico

 
en línea
Dang-Viet-Anh Nguyen, Jérôme Szewczyk and Kanty Rabenorosoa    
We propose a novel algorithm to determine the Euclidean shortest path (ESP) from a given point (source) to another point (destination) inside a tubular space. The method is based on the observation data of a virtual particle (VP) assumed to move along th... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Rhyd Lewis    
In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Yaqian Chen, Jiangfeng She, Xingong Li, Shuhua Zhang and Junzhong Tan    
Cost distance is one of the fundamental functions in geographical information systems (GISs). 3D cost distance function makes the analysis of movement in 3D frictions possible. In this paper, we propose an algorithm and efficient data structures to accur... ver más
Revista: ISPRS International Journal of Geo-Information    Formato: Electrónico

 
en línea
Mattia D?Emidio    
Computing shortest-path distances is a fundamental primitive in the context of graph data mining, since this kind of information is essential in a broad range of prominent applications, which include social network analysis, data routing, web search opti... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Sridhar Iyer,Shree Prakash Singh     Pág. 120 - 127
The spectrally efficient transportation of the high bit rate(s) data is achievable by the Elastic optical networks (EONs). However, in the EONs, owing to the failure occurrence even in an individual simple element, different service(s) may... ver más

 
en línea
Mazyar Seraj,Chui Yin Wong     Pág. pp. 24 - 30
This paper describes an experimental study of learning Dijkstra?s shortest path algorithm on mobile devices. The aim of the study is to investigate and compare the impacts of two different mobile screen user interfaces on students? satisfaction for learn... ver más

 
en línea
Mazyar Seraj,Chui Yin Wong     Pág. pp. 19 - 24
In recent years, many studies have been carried out on how to engage and support students in e-learning environments. Portable devices such as Personal Digital Assistants (PDAs), Tablet PCs, mobile phones and other mobile equipment have been used as part... ver más

« Anterior     Página: 1 de 1     Siguiente »