Search Results

1 - 10 of 1,928 items :

Clear All
Reliability Of Routing Protocols

5. Literatura [1] Laskowski D., Lubkowski, P.: Confidential transportation of data on the technical state of facilities, Advances in Intelligent Systems and Computing 286, pp. 313-324, 2014. [2] Dokument IEFT: RFC 1058: Routing Information Protocol, RFC 1723: RIP Version 2. [3] Dokument IEFT: RFC 1812: Requirements for IP Version 4 Routers. [4] Dokument IEFT: RFC 2328: OSPF Version 2. [5] Dokument IEFT: RFC 4271: A Border Gateway Protocol 4 (BGPv4). [6] Dokument IEFT: RFC 1771: A Border Gateway Protocol 4 (BGP-4). [7

Open access
An Ant Colony Algorithm for efficient ship routing

References 1. Bijlsma, S. J.,: A Computational Method for the Solution of Optimal Control Problems in Ship Routing. NAVIGATION, Journal of the Institute of Navigation , Vol. 48, pp. 145-154, 2001. 2. Bijlsma, S. J.: On the Application of Optimal Control Theory and Dynamic Programming in Ship Routing. NAVIGATION, Journal of the Institute of Navigation , Vol. 49, pp. 71-80, 2002. 3. Bijlsma, S. J.: Minimal Time Route Computation for Ships with Pre-Specified Voyage Fuel Consumption . The Journal of

Open access
On The Problem of Constructing Routes, Part I: Preface

., and Gurevich, Y. (1977) Constructing an optimal fleet for a transportation schedule. Transportation Science, 11(1), 20-36. 5. Gertsbakh, I., and Gurevich, Y. (1982) Homogeneous optimal fleet. Transportation Research Part B: Methodological, 16(6), 459-470. 6. Gertsbakh, I., and Stern, H.I. (1978) Minimal resources for fixed and variable job schedules. Operations Research, 26(1), 68-85. 7. Linis, V.K., and Maksim, M.S. (1967) On the problem of constructing routes. Proceedings of the Institute of Civil Aviation

Open access
Level Based Routing Using Dynamic Programming for 2D Mesh

References 1. Dally, W. J., B. Towels. Principle and Practices of Interconnection Networks. Elsevier, 2004. 2. Duato, J., S. Yalamanchili, L. Ni. Interconnection Networks. Elsevier, 2003. 3. Palesi, M., M. Daneshtalab. Routing Algorithms in Networks-on-Chip. Berlin, Springer, 2014. 4. Bhardwaj, V. P., R. V. Nitin. On the Minimization of Crosstalk Conflicts in a Destination Based Modified Omega Network. – Journal of Information Processing Systems, Vol. 9 , 2013, No 3, pp. 301-314. 5. Nitin, R. V., U. Srivastava. On a Deadlock and

Open access
A Cross Unequal Clustering Routing Algorithm for Sensor Network

Wireless Communications , 1 (4), 660-670. [4] Marcelloni, F., Vecchio, M. (2010). Enabling energyefficient and lossy-aware data compression in wireless sensor networks by multi-objective evolutionary optimization. Information Sciences , 180 (10), 1924-1941. [5] Chamam, A., Pierre, S. (2009). On the planning of wireless sensor networks: Energy-efficient clustering under the joint routing and coverage constraint. IEEE Transactions on Mobile Computing , 8 (8), 1077-1086. [6] Li, C., Ye, M., Chen, G., Wu, J. (2005). An

Open access
Multi-Objective Weather Routing of Sailboats Considering Wave Resistance

BIBLIOGRAPHY 1. Bijlsma, S.J.: Minimal Time Route Computation for Ships with Pre-Specified Voyage Fuel Consumption, J. Navig. 61 (2008) 723–733. 2. Dębski, R.: An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems, Int. J. Appl. Math. Comput. Sci. 26 (2016) 351–365. 3. Gao, M., G. Shi, W. Li, Y. Wang, D. Liu: ScienceDirect An improved genetic algorithm for island route planning, Procedia Eng. 174 (2017) 433–441. 4. Gerritsma, J., J.A. Keuning, R. Onnink

Open access
Multi-Objective Weather Routing of Sailing Vessels

Connexion with Graphs, Numer. Math. 1 (1959) 269-271. 5. Disser, Y., M. Müller-Hannemann, M. Schnee: Multicriteria Shortest Paths in Time-Dependent Train Networks, in: Exp. Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 2008: pp. 347-361. 6. Geisberger, R.: Advanced Route Planning in Transportation Networks, (2011) 227. 7. Johnson, B.: Operator Guidance Based on Assessing the Wind - Heel Angle Relationship of Traditionally - Rigged Sailing Vessels, (n.d.). 8. Jurdziński, M.: Podstawy Nawigacji

Open access
The development of a practical pipe auto-routing system in a shipbuilding CAD environment using network optimization

References Ando, Y. and Kimura, H., 2011. An automatic piping algorithm including elbows and bends. International Conference on Computer Applications in Shipbuilding (ICCAS). Trieste, Italy, 20-22 September 2011, 3, pp.153-158. Asmara, A. and Nienhuis, U., 2006. Automatic piping system in ship. International Conference on Computer and IT Application (COMPIT). Delft, Netherlands, 8-10 May 2006. Hightower, D.W., 1969. A solution to line routing problems on the continuous plane. Proceedings of Sixth Annual Design

Open access
Method of Routing Ships Sailing in Dedicated Environment

. Rep., No. 78-11, MIT, Cambridge, MA, 1978. [5] Krawczyk H., C2 NIWA: The Centre of Competence for Novel Infrastructure of Workable Applications, ‘TASK Quarterly’, 2015, Vol. 19, No. 4, pp. 357–369. [6] Langbein J., Stelzer R., Fruhwirth T., A Rule-Based Approach to Long-Term Routing for Autonomous Sailboats, Springer, Proceedings of the 4th International Robotic Sailing Conference, Lübeck 2011, pp. 193–204. [7] Philpott A., Sullivan R., Jackson P., Yacht velocity prediction using mathematical programming, ‘European Journal Operational Research

Open access
Suitability Analysis of Routing Algorithms for Web-based Transportation Planning

. IEEE Trans., vol. 4, no. 2, pp. 100-107, 1968. [4] R. Bellman, “On a Routing Problem,” Q. Appl. Math., vol. 16, pp. 87-90, 1958. [5] R. W. Floyd, “Algorithm 97: Shortest path,” Commun. ACM, vol. 5, no. 6, p. 345-, 1962. [6] S. Warshall, “A Theorem on Boolean Matrices,” J. ACM, vol. 9, no. 1, pp. 11-12, 1962. [7] M. J. d. Smith, M. F. Goodchild, and P. A. Longley, Geospatial Analysis: A Comprehensive Guide to Principles, Techniques and Software Tools, 3rd Revise. Matador, 2009, p. 516. [8

Open access