It is well known that A algorithm reduces the search space in many applications. For shortest path computations, the algorithm uses a heuristic estimator which can better guide the search to the destination. It allocates memory dynamically to store only the necessary vertices, which are those vertices in its open list and close list. Therefore, an A algorithm for the shortest paths search probl...

We investigate the all-pairs shortest paths problem in weighted graphs. We present an algorithm|the Hidden Paths Algorithm|that nds these paths in time O(m n+n 2 log n), where m is the number of edges participating in shortest paths. Our algorithm is a practical substitute for Dijkstra's algorithm. We argue that m is likely to be small in practice, since m = O(n logn) with high probability for ...

In this paper, we describe the way to set up the floppy-box Monte Carlo (FBMC) method [L. Filion, M. Marechal, B. van Oorschot, D. Pelt, F. Smallenburg, and M. Dijkstra, Phys. Rev. Lett. 103, 188302 (2009)] to predict crystal-structure candidates for colloidal particles. The algorithm is explained in detail to ensure that it can be straightforwardly implemented on the basis of this text. The ha...

Today’s social and economic development continues to improve people’s quality of life, private cars are widely popularized, self-driving tours have developed. The rapid travel has played an important role in the national economy, become popular. Because caused some problems, road network structure more complex, roads very congested. Especially during holidays, there tourist attractions How use ...

ion Techniques: model-checking raised interest in techniques to abstract infinite to finite models. Provided that the abstraction has been proven sound, testing may be sufficient for establishing correctness [10, 18]. Systematic Testing: the discussion over test adequacy criteria [27], i. e. criteria solving the question “when did we test enough to meet a given test hypothesis,” led to more sys...

This paper deals with the modelling, simulation-based controller design and path planning of a four rotor helicopter known as a quadrotor. All the drags, aerodynamic, coriolis and gyroscopic effect are neglected. A Newton-Euler formulation is used to derive the mathematical model. A smart self-tuning fuzzy PID controller based on an EKF algorithm is proposed for the attitude and position contro...

This paper proposes a new algorithm for finding K-nearest neighbors in large spatial networks. It employs a strategy of processing a network hierarchically. The new strategy is based on the CCAM algorithm for spatial network representation, the hierarchical approach for shortest path search and the INE algorithm for KNN search. It overcomes the problems of existing approaches: either the storag...

Multi-constrained Quality of Service (QoS) routing algorithm is always a difficult problem in routing research area, which is a NP problem. Software Defined Network (SDN) is a new network architecture, in which there’s few research on QoS routing. This paper generates the whole network virtual topology according to the characteristics of SDN, and based on the principle of simulated annealing, p...

—QoS routing algorithm is an important issue to research in wireless multimedia sensor networks (WMSNs). The least energy-consumption and real-time routing policies are addressed in the paper. A novel QoS routing algorithm is proposed to optimize QoS parameters based on event-sensitive node set. This algorithm includes three parts. Firstly, graph G of WMSNs is traversed and these nodes whose r...

We continue the research on termination detection for synchronous algorithms in P systems [1]. This paper is the first attempt to relate the classical definitions of process status and activation assumptions in the usual distributed computing framework to P systems. We validate our approach by modelling a well-known synchronous termination detection algorithm, the Dijkstra-Feijen-Van Gasteren (...