Spelling suggestions: "subject:"bnetwork analysis planning"" "subject:"conetwork analysis planning""
121 |
Transportation networks equilibration with discrete choice models.Sheffi, Yosef, 1948- January 1978 (has links)
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Civil Engineering. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: p. 119-124. / Ph.D.
|
122 |
Preliminary evaluation for road network improvement alternatives in less developed countries.Tsamboulas, Dimitrios Andreou January 1975 (has links)
Thesis. 1975. M.S.--Massachusetts Institute of Technology. Dept. of Civil Engineering. / Includes bibliographical references. / M.S.
|
123 |
Topics in dynamical processes in networked objects. / 探討網絡上的若干動態過程 / Topics in dynamical processes in networked objects. / Tan tao wang luo shang de ruo gan dong tai guo chengJanuary 2008 (has links)
Lee, Kwan Ho = 探討網絡上的若干動態過程 / 李鈞浩. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 114-118). / Abstracts in English and Chinese. / Lee, Kwan Ho = Tan tao wang luo shang de ruo gan dong tai guo cheng / Li Junhao. / Chapter 1 --- Overview --- p.1 / Chapter 2 --- Networks --- p.5 / Chapter 2.1 --- Describing Networks --- p.5 / Chapter 2.1.1 --- Adjacency Matrix --- p.6 / Chapter 2.1.2 --- "Degree, Degree Distribution and Mean Degree" --- p.6 / Chapter 2.1.3 --- Clustering Coefficient --- p.7 / Chapter 2.1.4 --- "Shortest Path, Shortest Distance and Diameter" --- p.7 / Chapter 2.1.5 --- Betweenness --- p.9 / Chapter 2.2 --- Barabasi-Albert (BA) Network --- p.10 / Chapter 2.2.1 --- Construction of BA Network --- p.10 / Chapter 2.2.2 --- Analytical Study of Degree Distribution --- p.11 / Chapter 2.2.3 --- Numerical Study of Degree Distribution --- p.12 / Chapter 2.2.4 --- Shortest Distance --- p.13 / Chapter 2.3 --- Summary --- p.14 / Chapter 3 --- Routing in Networks: A Review --- p.16 / Chapter 3.1 --- Introduction --- p.16 / Chapter 3.2 --- Dijkstra´ةs Algorithm --- p.17 / Chapter 3.2.1 --- Algorithm --- p.17 / Chapter 3.2.2 --- Running Time --- p.18 / Chapter 3.2.3 --- Routing Table Based on Shortest Path Algorithm --- p.19 / Chapter 3.3 --- Routing Model --- p.19 / Chapter 3.3.1 --- General Setup --- p.19 / Chapter 3.3.2 --- Phase Transition and Evaluation of Network Performance --- p.20 / Chapter 3.4 --- Using Shortest Path as Routing Algorithm on BA Networks --- p.21 / Chapter 3.5 --- Other Routing Algorithms --- p.22 / Chapter 3.5.1 --- Efficient Path --- p.23 / Chapter 3.5.2 --- Routing based on Local Structural Information --- p.24 / Chapter 3.5.3 --- Routing based on Dynamical Information --- p.25 / Chapter 3.6 --- Summary --- p.26 / Chapter 4 --- Optimization of Routing Efficiency through Redistributing Limited Resources --- p.28 / Chapter 4.1 --- A Reallocation Rule - Short to Long (S2L) --- p.29 / Chapter 4.2 --- Performance Enhancement After Applying S2L --- p.33 / Chapter 4.3 --- Optimized Capability Distribution in Detail --- p.36 / Chapter 4.4 --- Summary --- p.44 / Chapter 5 --- N-person Evolutionary Snowdrift Game: A Review --- p.47 / Chapter 5.1 --- Snowdrift Game (SG) and Evolutionary Snowdrift Game (ESG) --- p.47 / Chapter 5.2 --- N-person Evolutionary Snowdrift Game --- p.49 / Chapter 5.2.1 --- Payoffs of C-character and D-character Agents --- p.49 / Chapter 5.2.2 --- Replicator Dynamics --- p.50 / Chapter 5.2.3 --- Numerical Simulations --- p.52 / Chapter 5.3 --- Summary --- p.55 / Chapter 6 --- NESG on Complex Network --- p.56 / Chapter 6.1 --- Models --- p.57 / Chapter 6.2 --- Results of Model A (varying N) --- p.58 / Chapter 6.2.1 --- Correlation of Characters in Degree --- p.60 / Chapter 6.2.2 --- Correlation of Characters in Distance --- p.62 / Chapter 6.3 --- Results of Model B (Fixed-N) --- p.63 / Chapter 6.3.1 --- Correlation of Characters in Degree --- p.64 / Chapter 6.4 --- Summary --- p.69 / Chapter 7 --- Synchronization: A Review --- p.71 / Chapter 7.1 --- Kuramoto Model --- p.72 / Chapter 7.1.1 --- Analytical Method --- p.74 / Chapter 7.1.2 --- Numerical Method --- p.78 / Chapter 7.1.3 --- Summary of Kuramoto Model --- p.81 / Chapter 7.2 --- Integrate-and-Fire Model --- p.81 / Chapter 8 --- Kuramoto Model with Spatially Distributed Oscillators --- p.84 / Chapter 8.1 --- Model --- p.84 / Chapter 8.2 --- Numerical Results --- p.85 / Chapter 8.3 --- Analytic Results --- p.87 / Chapter 8.4 --- Summary --- p.90 / Chapter 9 --- Integrate-Fire-and-Run Model --- p.92 / Chapter 9.1 --- Model --- p.92 / Chapter 9.2 --- Two-Body System --- p.94 / Chapter 9.2.1 --- Case I: Oscillators A and B are in different sites --- p.94 / Chapter 9.2.2 --- Case II: Oscillators A and B are in the same site --- p.101 / Chapter 9.2.3 --- Comparison of Analytic Results and Numerical Simulations of Two-Body system --- p.103 / Chapter 9.3 --- N-Body System --- p.105 / Chapter 9.4 --- Summary --- p.111 / Chapter 10 --- Outlook --- p.112 / Bibliography --- p.114
|
124 |
New algorithms for assignment and transportation problemsJanuary 1979 (has links)
by Dimitri P. Bertsekas. / Includes bibliographies. / Research supported by National Science Foundation Grant ENG-79-06332 (87649)
|
125 |
Minimizing the number of vehicles to meet a fixed periodic schedule : an application of periodic posetsJanuary 1980 (has links)
by James B. Orlin. / Includes bibliographical references (leaf 25). / Supported in part by the U.S. Army Research Office. DAAG29-80-C-0061
|
126 |
An overview of vehicular scheduling problemsJanuary 1974 (has links)
by Henry Gabbay. / Work performed under Contract N00014-67-A-0204-0076, Office of Naval Research, Multilevel Logistics Organization Models, NR 347-027, MIT/OSP 81138. / Bibliography: leaves 19-21.
|
127 |
Location of facilities on a stochastic networkJanuary 1974 (has links)
by Pitu Mirchandani. / Prepared under National Science Foundation Grant GI38004. OR 039-74. / Bibliography: leaf 15.
|
128 |
Network flow optimization in flexible manufacturing systemsJanuary 1978 (has links)
by J. Kimemia, S.B. Gershwin. / Bibliography: leaf 6. / Caption title. / Supported by the National Science Foundation under Grant APR76-12036 National Science Foundation Grant DAR 78-17826
|
129 |
Stochastic dynamic traffic assignment for intermodal transportation networks with consistent information supply strategiesAbdelghany, Khaled Faissal Said, January 2001 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from Dissertation Abstracts.
|
130 |
A reliability-based land use and transportation optimization modelYim, Ka-wing., 嚴家榮. January 2005 (has links)
published_or_final_version / abstract / Civil Engineering / Master / Master of Philosophy
|
Page generated in 0.1214 seconds