نتایج جستجو برای: shortest path problem
تعداد نتایج: 998686 فیلتر نتایج به سال:
The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the d-dimensional space of deformation parameters. Fission half lives of heavy isotopes (100<Z<110) are shown and compared to the experimental data. 1. Introductory remark...
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
Let G = ( V , E ) be a simple, connected graph. One is often interested in short path between two vertices u v ∈ . We propose spectral algorithm: construct the function ϕ : → R ≥ 0 arg min f ≢ ∑ w 1 2 − can also understood as smallest eigenvector of Laplacian Matrix L D A after -th row and column have been removed. start point from to at each step, we move neighbor for which smallest. This al...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید