8 research outputs found
Town of New London, New Hampshire annual reports of the town officers, boards and other agencies for year ending December 31, 1995.
This is an annual report containing vital statistics for a town/city in the state of New Hampshire
Clovis News, 08-13-1915
https://digitalrepository.unm.edu/clovis_news/1131/thumbnail.jp
The Fighting Twenty-First, Volume 2
https://digitalcommons.wustl.edu/fighting_21st/1004/thumbnail.jp
Recommended from our members
Proceedings of the Third International Workshop on the implementation of ALARA at nuclear power plants
This report contains the papers presented and the discussions that took place at the Third International Workshop on ALARA Implementation at Nuclear Power Plants, held in Hauppauge, Long Island, New York from May 8--11, 1994. The purpose of the workshop was to bring together scientists, engineers, health physicists, regulators, managers and other persons who are involved with occupational dose control and ALARA issues. The countries represented were: Canada, Finland, France, Germany, Japan, Korea, Mexico, the Netherlands, Spain, Sweden, the United Kingdom and the United States. The workshop was organized into twelve sessions and three panel discussions. Individual papers have been cataloged separately
Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm
Abstract— Online transportation has become a basic
requirement of the general public in support of all activities to go
to work, school or vacation to the sights. Public transportation
services compete to provide the best service so that consumers
feel comfortable using the services offered, so that all activities
are noticed, one of them is the search for the shortest route in
picking the buyer or delivering to the destination. Node
Combination method can minimize memory usage and this
methode is more optimal when compared to A* and Ant Colony
in the shortest route search like Dijkstra algorithm, but can’t
store the history node that has been passed. Therefore, using
node combination algorithm is very good in searching the
shortest distance is not the shortest route. This paper is
structured to modify the node combination algorithm to solve the
problem of finding the shortest route at the dynamic location
obtained from the transport fleet by displaying the nodes that
have the shortest distance and will be implemented in the
geographic information system in the form of map to facilitate
the use of the system.
Keywords— Shortest Path, Algorithm Dijkstra, Node
Combination, Dynamic Location (key words