Evaluating Regular Path Queries (RPQs) have been of interest since they were used as a powerful way to explore paths and patterns in graph databases. Traditional automata-based approaches are restricted the size and/or highly complex queries, which causes high evaluation cost (e.g., memory space response time) on large graphs. Recently, although using approach based threshold rare label for gra...

An important and frequently used tool in archaeological spatial analysis is least-cost path (LCP) to compute routes connecting a set of targets. The outcome depends on the cost model chosen topographic data used. A slope-dependent requires digital elevation (DEM) that should reflect landscape past. It often impossible reconstruct past terrain, modern high-resolution results problematic storage ...

First, we define a stochastic shortest path problem (SSP) on Borel space considering the distribution of total cost. Next, for this SSP, policy classes are set number steps to reach terminal state first time, and is designed each class. There no guarantee that probability large cost small with expected value (expected cost). The minimizes or Conditional Value at Risk (CVaR) may not state. propo...

Selfish routing is one of the most studied problems in algorithmic game theory, with one of the principal applications being that of routing in road networks. The majority of related work, in the many variants of the problem, deals with the inefficiency of equilibria to which users are assumed to converge. Multiple mechanisms for improving the outcomes at equilibria have been considered, such a...

In this paper, we compare and analyze six different path loss models (i.e. FSPL model, COST 231 Hata model, ECC-33 model, SUI model, Ericsson model and COST 231 Walfish-Ikegami model) in different receiver antenna heights in urban, suburban and rural environments in NLOS condition for WiMAX. We consider Bangladesh as three regions such: Urban, Suburban, flat area and use operating frequency 2.5...