Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

89 results for “k-Paths”
Set a search alert
Research ArticleOpen accessEvery word in the titleA Heuristic Moving Vehicle Location Prediction Technique Via Optimal Paths Selection with Aid of Genetic Algorithm and Feed Forward Back Propagation Neural NetworkE. Baby Anitha, K. DuraiswamyThe moving object or vehicle location prediction based on their spatial and temporal information is an important task in many applications. Different methods were utilized for performing the vehicle movement detection and prediction process. In such works, there is a lack of analysis in predicting the vehicles location in current as well as in future. Moreover, such methods compute the … …Journal of Computer Science, Vol. 8, Issue 12 · 12 Dec 2012 · 8,888 accessesView PDFCite
Research ArticleOpen accessEvery word in the titlePerformance Metrics of Multipath State Aware Concurrent Multipath Transfer using Redundant Transfer in Stream Control Transmission Protocol Multihoming for Symmetric PathsM. Subramaniam, D. ManjulaProblem statement: In multihomed host, if data transfer starts using CMT, unaware of paths status causes delay in data transfer or packet loss due to path failure. Transmission Path (one or more paths) failures result in out-of-order data delivery causing receiver buffer blocking and preventing sender from transmitting further data. Approach: Multipath State Aware Concurrent Multipath Transfer using Redundant Transfer … …Journal of Computer Science, Vol. 7, Issue 12 · 21 Oct 2011 · 6,798 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleDistribution of Records Defined on Ordered Words Representing Lattice PathsA. M. Alahmadi, E. A. MahmoudProblem statement: Let the sequence i1,i2,…,in, denoted by Snn be an increasing ordered word of length n taken from the set of the n positive integers S= {1,2,…,n}, m, n ∈N+, m≥n.. Approach: That is 1≤i1≤i2≤…≤in≤n. Treating Snn as a sequence of weak records {Lj = ij}, i, j = 1,2,…,n, the distribution of the single weak record as well … …Journal of Mathematics and Statistics, Vol. 7, Issue 3 · 18 Jul 2011 · 6,998 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA REFINEMENT OF DIJKSTRA'S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHSSiddhartha Sankar Biswas, Bashir Alam, M. N. DojaThe networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network), attack or damage from internal or external agents, sudden failure of one or … …Journal of Computer Science, Vol. 10, Issue 4 · 14 Dec 2013 · 7,260 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleGeneralization of Dijkstra’s Algorithm for Extraction of Shortest Paths in Directed MultigraphsBashir Alam, Siddhartha Sankar Biswas, M. N. DojaThe classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short). The GDA outputs the shortest paths and the corresponding min cost. It … …Journal of Computer Science, Vol. 9, Issue 3 · 29 Apr 2013 · 7,466 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOn Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci CubesIoana Zelina, Grigor Moldovan, Ioana TascuThe interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,281 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAutomatic Discovery of Association Paths in Relational Databases Using Software VisualizationHaider Ali RamadhanWe introduce a visual framework for facilitating tasks associated with database maintenance and re-use. The prototype system embodying the framework is presented. The system utilizes various techniques and features of software visualization. The system supports visual displays of the database structure along with various implicit relationships found in it such as associations and path views. Information visualized is automatically extracted … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,643 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEstablishing an Evacuation Network: A Path Ranking ApproachHoussein Alaeddine, Kamal Serrhini, Mindjid Maizia, Emmanuel NéronThe evacuation of population exposed to flood hazard requires the establishment of a specific transportation network. This is to compute escape routes to be taken by affected population. At evacuation time, inhabitants of affected area must be evacuated through transportation network to safety area. The main objective of this work is to provide assistance to rescue forces in terms of … …Journal of Computer Science, Vol. 15, Issue 12 · 3 Dec 2019 · 7,899 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMinimizing Transmission Time under Required System Capacity Constraint in Stochastic-Flow NetworksMoatamad Refaat HassanIn the case of an existing limited capacity of the system called required system capacity, in this study a new method is presented to determine the disjoint paths to send data from the source to the sink. System reliability is evaluated as the probability that a specified amount of data can be transmitted from a source to a sink through … …American Journal of Applied Sciences, Vol. 15, Issue 5 · 5 May 2018 · 7,672 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEfficient Multipath Routing and Wavelength Allocation Using Traffic Grooming in Optical Wavelength Division Multiplexing Mesh NetworksV. Rajamani, T. KavithaIn optical WDM mesh networks, traffic grooming is essential in order to utilize the bandwidth efficiently to minimize the cost and meet the user service requirement. By grooming traffic, it is possible to reduce the total cost of all Add drop multiplexer needed. Also for the high processing capability in a WDM network, the path should be capable of carrying … …Journal of Computer Science, Vol. 8, Issue 11 · 19 Sep 2012 · 6,522 accessesView PDFCite