Open Access. Powered by Scholars. Published by Universities.®
Electrical and Computer Engineering
University of Nevada, Las Vegas
Articles 1 - 4 of 4
Full-Text Articles in Engineering
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
Electrical & Computer Engineering Faculty Research
We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.
Investigation Of Nanoporous Thin-Film Alumina Templates, Biswajit Das
Investigation Of Nanoporous Thin-Film Alumina Templates, Biswajit Das
Electrical & Computer Engineering Faculty Research
This paper presents the results of a systematic study of the fabrication of thin-film alumina templates on silicon and other substrates. Such templates are of significant interest for the low-cost implementation of semiconductor and metal nanostructure arrays. In addition, thin-film alumina templates on silicon have the potential for nanostructure integration with silicon electronics. Formation of thin-film alumina templates on silicon substrates was investigated under different fabrication conditions, and the dependence of pore morphology and pore formation rate on process parameters was evaluated. In addition, process conditions for improved pore size distribution and periodicity were determined. The template/silicon interface, important for …
Quantization With Knowledge Base Applied To Geometrical Nesting Problem, Grzegorz Chmaj, Leszek Koszalka
Quantization With Knowledge Base Applied To Geometrical Nesting Problem, Grzegorz Chmaj, Leszek Koszalka
Electrical & Computer Engineering Faculty Research
Nesting algorithms deal with placing two-dimensional shapes on the given canvas. In this paper a binary way of solving the nesting problem is proposed. Geometric shapes are quantized into binary form, which is used to operate on them. After finishing nesting they are converted back into original geometrical form. Investigations showed, that there is a big influence of quantization accuracy for the nesting effect. However, greater accuracy results with longer time of computation. The proposed knowledge base system is able to strongly reduce the computational time.
A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
Electrical & Computer Engineering Faculty Research
We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.