Impact Factor:6.549
Scopus Suggested Journal: |
International Journal
of Computer Engineering in Research Trends (IJCERT)
Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary
International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary
ISSN(Online):2349-7084 Submit Paper Check Paper Status Conference Proposal
[1] N. Mondal, M. Bag, M. Mukherjee, S. Chatterjee, N. Pervin, G. C. Banerjee,” Characteristics and Nature of Routing Protocols Used in VANET: A Comprehensive Study. “International Journal of Computer Engineering in Research Trends., vol.2, no.5, pp.284-287, 2015. [2] Ramesh S Gawali, Prof. Mrunali G. Vaidya,” Selection and Maintenance of Materialized Views using Genetic Algorithm. “International Journal of Computer Engineering in Research Trends., vol.3, no.12, pp. 629-631, 2016. [3] M.SHIRISHA, M.RADHA,” AMES-Cloud: A Framework of AMOV & ESOL using Clouds. “International Journal of Computer Engineering in Research Trends., vol.2, no.5, pp. 305-309, 2015. [4] Shital M Kuwarkar, Prof. U.A.Nul,” Energy Consumption on Smartphone Web Browsing in 3G Network. “International Journal of Computer Engineering in Research Trends., vol.4, no.7, pp. 290-295, 2017. [5] Dr. Subhi R. M. Zeebaree, Karwan Jacksi,” Effects of Processes Forcing on CPU and Total Execution-Time Using Multiprocessor Shared Memory Systemd. “International Journal of Computer Engineering in Research Trends., vol.2, no.4, pp. 275-279, 2015. [6] Mr .BETKAR AKSHAY SURESH, Mrs. N.SUJATHA,” PROGRESSIVE DUPLICATE DETECTION. “International Journal of Computer Engineering in Research Trends., vol.3, no.6, pp. 284-288, 2016. [7] H. Mahmud, A. M. Amin, M. E. Ali, and T. Hashem, “Shared Execution of Path Queries on Road Networks,” Clinical Orthopaedics and Related Research, vol. abs/1210.6746, 2012. [8] L. Zammit, M. Attard, and K. Scerri, “Bayesian Hierarchical Modelling of Traffic Flow - With Application to Malta’s Road Network,” in International IEEE Conference on Intelligent Transportation Systems, 2013, pp. 1376–1381. [9] S. Jung and S. Pramanik, “An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps,” IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 5, pp. 1029–1046, 2002. [10] E. W. Dijkstra, “A Note on Two Problems in Connexion with Graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, 1959. [11] U. Zwick, “Exact and approximate distances in graphs – a survey,” in Algorithms – ESA 2001, 2001, vol. 2161, pp. 33–48. [12] A. V. Goldberg and C. Silverstein, “Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets,” in Network Optimization, [13] P. Hart, N. Nilsson, and B. Raphael, “A Formal Basis for the Heuristic Determination of Minimum Cost Paths,” IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1967. [14] A. V. Goldberg and C. Harrelson, “Computing the Shortest Path: A Search Meets Graph Theory,” in ACM Symposium on Discrete Algorithms, 2005. [15] R. Gutman, “Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks,” in Workshop on Algorithm Engineering and Experiments, 2004. [16] A. V. Goldberg, H. Kaplan, and R. F. Werneck, “Reach for A*: Efficient Point-to-Point Shortest Path Algorithms,” in Workshop on Algorithm Engineering and Experiments, 2006, pp. 129–143. [17] S. Jung and S. Pramanik, “An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps,” IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 5, pp. 1029–1046, 2002. [18] R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina, “Proximity Search in Databases,” in International Conference on Very Large Data Bases, 1998, pp. 26–37. [19] N. Jing, Y.-W. Huang, and E. A. Rundensteiner, “Hierarchical Optimization of Optimal Path Finding for Transportation Applications,” in ACM Conference on Information and Knowledge Management, 1996. [20] N. Jing, Y. wu Huang, and E. A. Rundensteiner, “Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and its Performance Evaluation,” IEEE Transactions on Knowledge and Data Engineering, vol. 10, pp. 409–432, 1998. [21] U. Demiryurek, F. Banaei-Kashani, C. Shahabi, and A. Ranganathan, “Online Computation of Fastest Path in Time-Dependent Spatial Networks,” in International Conference on Advances in Spatial and Temporal Databases, 2011. [22] H. Gonzalez, J. Han, X. Li, M. Myslinski, and J. P. Sondag, “Adaptive Fastest Path Computation on a Road Network: a Traffic Mining Approach,” in International Conference on Very Large Data Bases, 2007. [23] J. R. Thomsen, M. L. Yiu, and C. S. Jensen, “Effective caching of shortest paths for location-based services,” in ACM International Conference on Management of Data, 2012.
![]() | V4I1102.pdf |