Vehicle navigation is currently the most widespread and successful consumer application of GIS-T. It is based on positional accurate data and comprehensive transportation-related content. A specially-made navigable database is essential for the key functions of the vehicle navigation systems, for example, route finding and driver guiding. There are lots of research challenges in generating a sa...

High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally foc...

Online social networks are often defined by considering interactions of entities at an aggregate level. For example, a call graph is formed among individuals who have called each other at least once; or at least k times. Similarly, in social-media platforms we consider implicit social networks among users who have interacted in some way, e.g., have made a conversation, have commented to the con...

The growing size of the network imposes computational overhead during route establishment using conventional approaches routing protocol. alternate approach in contrast to table updating mechanism is rule-based method, but this also provides a limited scope dynamic networks. Therefore, reinforcement learning promises better way finding route, it requires an evaluation platform build model synch...

Social creatures interact in diverse ways: forming groups, mating, sending emails, and sharing ideas. Some of the interactions are accidental while others are a consequence of the underlying explicit or implicit social structures [5, 6, 22, 28]. One of the most important questions in sociology is the identification of such structures, which are variously viewed as communities [8, 9, 11,12,24,36...

Search is often used to find shortest routes within real road networks. Standard search algorithms are memory intensive and inefficient for stand alone in-car systems. In this paper, we evaluate a number of heuristic search strategies in terms of space and time complexity for the route finding problem. Route Finding and Search Much research in recent years has focussed on developing technologie...

We present the rst polynomial-time algorithm that nds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is called the shortest watchman route, and we do not assume any restrictions on the route or on the simple polygon. Our algorithm runs in worst case O(n 6) time, but it is adaptive making it run faster on polygons with simple str...