Efficient computation of geodesic shortest paths

1999 ◽  
Author(s):  
Sanjiv Kapoor
Keyword(s):  
Shortest Paths ◽  
Efficient Computation

An improved watershed algorithm based on efficient computation of shortest paths

2007 ◽  
Vol 40 (3) ◽  
pp. 1078-1090 ◽  
Author(s):  
Víctor Osma-Ruiz ◽  
Juan I. Godino-Llorente ◽  
Nicolás Sáenz-Lechón ◽  
Pedro Gómez-Vilda
Keyword(s):  
Shortest Paths ◽  
Watershed Algorithm ◽  
Efficient Computation

scholarly journals Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics

2007 ◽  
Vol 2007 ◽  
pp. 1-25 ◽  
Author(s):  
Ammar W. Mohemmed ◽  
Nirod Chandra Sahoo
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Shortest Path ◽  
Hybrid Algorithm ◽  
Shortest Paths ◽  
Particle Swarm ◽  
Elementary Transformation ◽  
Efficient Computation ◽  
Hybrid Search ◽  
Swarm Optimization

This paper presents a novel hybrid algorithm based on particle swarm optimization (PSO) and noising metaheuristics for solving the single-source shortest-path problem (SPP) commonly encountered in graph theory. This hybrid search process combines PSO for iteratively finding a population of better solutions and noising method for diversifying the search scheme to solve this problem. A new encoding/decoding scheme based on heuristics has been devised for representing the SPP parameters as a particle in PSO. Noising-method-based metaheuristics (noisy local search) have been incorporated in order to enhance the overall search efficiency. In particular, an iteration of the proposed hybrid algorithm consists of a standard PSO iteration and few trials of noising scheme applied to each better/improved particle for local search, where the neighborhood of each such particle is noisily explored with an elementary transformation of the particle so as to escape possible local minima and to diversify the search. Simulation results on several networks with random topologies are used to illustrate the efficiency of the proposed hybrid algorithm for shortest-path computation. The proposed algorithm can be used as a platform for solving other NP-hard SPPs.

scholarly journals Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks

2015 ◽  
Vol 19 ◽  
pp. 1-29 ◽  
Author(s):  
Dominik Kirchler ◽  
Leo Liberti ◽  
Roberto Wolfler Calvo
Keyword(s):  
Shortest Paths ◽  
Time Dependent ◽  
Efficient Computation

No fear of George Kingsley Zipf

10.1558/37291 ◽  
2018 ◽  
Vol 2 (2) ◽  
pp. 242-263
Author(s):  
Stefano Rastelli ◽  
Kook-Hee Gil
Keyword(s):  
Minimalist Program ◽  
Classroom Research ◽  
Language Design ◽  
Efficient Computation ◽  
Generative Linguistics ◽  
The Third ◽  
Factor Effect ◽  
Language Classroom ◽  
Recent Developments ◽  
Insight Into

This paper offers a new insight into GenSLA classroom research in light of recent developments in the Minimalist Program (MP). Recent research in GenSLA has shown how generative linguistics and acquisition studies can inform the language classroom, mostly focusing on what linguistic aspects of target properties should be integrated as a part of the classroom input. Based on insights from Chomsky’s ‘three factors for language design’ – which bring together the Faculty of Language, input and general principles of economy and efficient computation (the third factor effect) for language development – we put forward a theoretical rationale for how classroom research can offer a unique environment to test the learnability in L2 through the statistical enhancement of the input to which learners are exposed.

eMap: A Web Application for Identifying and Visualizing Electron or Hole Hopping Pathways in Proteins

2019 ◽  
Author(s):  
Ruslan N. Tazhigulov ◽  
James R. Gayvert ◽  
Melissa Wei ◽  
Ksenia B. Bravaya
Keyword(s):  
Web Application ◽  
Shortest Paths ◽  
Coarse Grained ◽  
Decay Parameter ◽  
Electron Hole ◽  
Web Based ◽  
Aromatic Amino Acid Residue ◽  
Pathways Model ◽  
Visualization Tools ◽  
Effective Decay

<p>eMap is a web-based platform for identifying and visualizing electron or hole transfer pathways in proteins based on their crystal structures. The underlying model can be viewed as a coarse-grained version of the Pathways model, where each tunneling step between hopping sites represented by electron transfer active (ETA) moieties is described with one effective decay parameter that describes protein-mediated tunneling. ETA moieties include aromatic amino acid residue side chains and aromatic fragments of cofactors that are automatically detected, and, in addition, electron/hole residing sites that can be specified by the users. The software searches for the shortest paths connecting the user-specified electron/hole source to either all surface-exposed ETA residues or to the user-specified target. The identified pathways are ranked based on their length. The pathways are visualized in 2D as a graph, in which each node represents an ETA site, and in 3D using available protein visualization tools. Here, we present the capability and user interface of eMap 1.0, which is available at https://emap.bu.edu.</p>

Computer algorithms

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Shortest Paths ◽  
Minimum Cut ◽  
Network Data ◽  
Computer Algorithms ◽  
Breadth First Search ◽  
Augmenting Path ◽  
Basic Concepts ◽  
Maximum Flows

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.

Sign in / Sign up

Export Citation Format

Share Document