Filters








371,013 Hits in 6.3 sec

A Note on Shortest Developments

Morten Sørensen, Henk Barendregt
2007 Logical Methods in Computer Science  
strategy computing shortest developments as well as a simple formula computing their length.  ...  We show that by applying a rather simple and intuitive principle of duality to de Vrijer's approach one arrives at a proof that some developments are finite which in addition yields an effective reduction  ...  In contrast, the above shows that one can effectively compute both shortest and longest complete developments, and the proofs reveal a duality between the two concepts.  ... 
doi:10.2168/lmcs-3(4:2)2007 fatcat:hsaflnffebhobg776mmtu3ryxq

Page 201 of Geographical Analysis Vol. 8, Issue 2 [page]

1976 Geographical Analysis  
Research Notes and Comments A Note on Finding the Shortest Spanning Tree Of a Graph by Programmable Methods Trevor R.  ...  Development of Computer Subroutines The subtree assembly, growth of a single subtree, and Prim’s method have been programmed as external procedures (i.e., subroutines) in PL/ 1.  ... 

The Shortcut Problem – Complexity and Approximation [chapter]

Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
2009 Lecture Notes in Computer Science  
h(s, t) = minimal number of edges on a shortest s-t-path in G h (s, t) = minimal number of edges on a shortest s-t-path in G Results on Complexity: NP-completeness • The Shortcut Decision Problem is NP-complete  ...  is given in the paper Ongoing work on the problem • Experimentally evaluate the approaches developed • O(n 3 ) algorithm for the greedy-approach recently has been developed • Test how good evolutionary  ...  (s, t) = minimal number of edges on a shortest s-t-path in G  ... 
doi:10.1007/978-3-540-95891-8_13 fatcat:gb7svmjbsbdhbpi3rgcv5t3g3i

Finding theKShortest Loopless Paths in a Network

Jin Y. Yen
1971 Management science  
Note that the above algorithm is developed from an obvious fact [3] , [5] that Ak is a deviation from A', j = 1, 2, * * *, k -1.  ...  Yen's algorithm [12] is a newly developed algorithm which finds the lengths of all shortest paths from a fixed node to all other nodes in an N-node nonnegative-distance network.  ... 
doi:10.1287/mnsc.17.11.712 fatcat:cpi4oetkhzemfewsovasafc36i

On evaluating the efficiency of software feature development using algebraic manifolds

Jay Kothari, Dmitriy Bespalov, Spiros Mancoridis, Ali Shokoufandeh
2008 2008 IEEE International Conference on Software Maintenance  
Using the FDMs we can compute the preferred development path for a given feature.  ...  This development path includes the versions of a software feature that contributed to the final version of the feature in a positive way.  ...  Figure 6 depicts the actual development path (solid It is important to note that, when computing the shortest development path using the original similarity matrix, that 2 versions actually fall on this  ... 
doi:10.1109/icsm.2008.4658049 dblp:conf/icsm/KothariBMS08 fatcat:hloxdjjinbhdtbrm4xbtt7hkhu

Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

I. Chabini, Shan Lan
2002 IEEE transactions on intelligent transportation systems (Print)  
This paper extends the A* methodology to shortest path problems in dynamic networks, in which arc travel times are time dependent.  ...  We summarize useful properties of dynamic networks and develop improved lower bounds on minimum travel times.  ...  Note that all the above developments of the A* algorithm have focused on static networks only. In this paper, we study dynamic networks and develop efficient specializations of the A* algorithm.  ... 
doi:10.1109/6979.994796 fatcat:rcnja5ga55fephcdrhasksyxya

A Note on the V-Shaped Property in One-Machine Scheduling

Bahram Alidaee, Duane Rosa
1995 Journal of the Operational Research Society  
Alll rights reserved. 0160-5682/95 $9.00 ee A Note on the V-shaped Property in One-Machine Scheduling BAHRAM ALIDAEE and DUANE ROSA West Texas State University, USA This note deals with a one-machine scheduling  ...  available to be processed non-preemptively on a single machine.  ... 
doi:10.2307/2583843 fatcat:3xvfpdllh5bcnoagbp3xmr46se

Link Prediction Using Top-k Shortest Distances [chapter]

Andrei Lebedev, JooYoung Lee, Victor Rivera, Manuel Mazzara
2017 Lecture Notes in Computer Science  
Our results show that using top-k distances as a similarity measure outperforms classical similarity measures such as Jaccard and Adamic/Adar.  ...  We compare the results with other base line and state-of-the-art methods as well as with the shortest path.  ...  We utilize this algorithm to obtain the distances and then develop a similarity metric based on them to predict links on graphs.  ... 
doi:10.1007/978-3-319-60795-5_10 fatcat:jcbubwvhv5cflnwiwh6gxj5t24

Approximating Shortest Paths in Graphs [chapter]

Sandeep Sen
2009 Lecture Notes in Computer Science  
In this article, we trace some of the fundamental developments like spanners and distance oracles, their underlying constructions, as well as their applications to the approximate all-pairs shortest paths  ...  In contrast, there has been a growing interest in the area of algorithms for approximate shortest paths leading to many interesting variations of the original problem.  ...  Note the dependence of the time complexity on the absolute value of max edge weight -this is not acceptable in most of the situations.  ... 
doi:10.1007/978-3-642-00202-1_3 fatcat:u22g6ldmgjgpvelv4jnob5r6ma

Parallel Algorithms for Dynamic Shortest Path Problems

Ismail Chabini, Sridevi Ganugapati
2002 International Transactions in Operational Research  
Recently, a sequential algorithm was developed to compute shortest paths in discrete time dynamic networks from all nodes and all departure times to one destination node.  ...  We also develop a time-based parallel version of algorithm DOT for the case of minimum time paths in FIFO networks, and a theoretical parallelization of algorithm DOT on an 'ideal' theoretical parallel  ...  Thus, the maximum speed-up of algorithm DOT on an ideal parallel machine is approximately O(m à log R): Note that a better implementation of algorithm DOT on an ideal parallel computer, can be developed  ... 
doi:10.1111/1475-3995.00356 fatcat:qoe7rfqllzgffceynteg3k7o4u

Page 65 of American Society of Civil Engineers. Collected Journals Vol. 118, Issue 2 [page]

1992 American Society of Civil Engineers. Collected Journals  
This requires the development of a shortest-path algorithm, in which we represent the lake as a polygon.  ...  Note. Discussion open until November 1, 1992. To extend the closing date one month, a written request must be filed with the ASCE Manager of Journals.  ... 

A Note on the Shortest Spanning Tree Problem, by

James R. Evans
2010 Geographical Analysis  
A Note on Finding the Shortest Spanning Tree of a Graph by Programmable Methods.” Geographical Analysis, 8 (April 1976), 201-4. , .  ...  “The P,P;/D Hypothesis: On the Intercity Movement of Persons.” American Sociological Review, 11 (1946), 677-86. A Note on the Shortest Spanning Tree Problem, by James R.  ... 
doi:10.1111/j.1538-4632.1978.tb00658.x fatcat:jma76i557nbztjtvoexeipihki

Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies

Oleg G. Monakhov, Emilia A. Monakhova, Aleksandr Yu. Romanov, Andrej M. Sukhov, Evgenii V. Lezhnev
2021 IEEE Access  
It becomes possible to determine the set of the shortest paths for routing due to the relative addresses of destination nodes based on a parametric description of the network.  ...  A new pair routing algorithm for transmitting messages in multiprocessor systems and networks-on-chip based on circulant networks of arbitrary dimension is proposed.  ...  Note that known in the literature pair routing algorithms have been developed for a number of separate families of circulants of dimensions with an analytical description [8, 10, [26] [27] [28] [29] [  ... 
doi:10.1109/access.2021.3131635 fatcat:khkx3wmulne27aurh6yx3ynd2u

The Physarum Computer [chapter]

Kurt Mehlhorn
2011 Lecture Notes in Computer Science  
The net flow out of s is one and the net flow into t is one. The edge diameters develop according to the rule  ...  In a nutshell, the shortest path experiment is as follows: A maze is built and the mold is made to cover the entire maze.  ...  For the edges on the shortest s-t-path, the diameter converges to one, and for the edges off the shortest path, the diameter converges to zero.  ... 
doi:10.1007/978-3-642-19094-0_3 fatcat:ltahihjqyvhcravobfu4a7f45i

Identification of drought responsive proteins using gene ontology hierarchy

Vinay Sharma, Manoj Kumar Sekhwal, Ajit Kumar Swami, Renu Sarin
2012 Bioinformation  
Here, we developed a method to obtain functional distances between GO terms and analyzed distance values to allocate shortest path (SP) in GO hierarchy.  ...  We developed a new method to obtain functional distances between GO terms and the analysis of distance values to allocate the shortest path (SP) in GO hierarchy.  ...  The shortest path method developed in this study was applied on hierarchical structured GO terms in molecular function, biological process and cellular component.  ... 
doi:10.6026/97320630008595 pmid:22829738 pmcid:PMC3400982 fatcat:5ufar3mf2jfh5ozapcl5ntjm7u
« Previous Showing results 1 — 15 out of 371,013 results