Search results for "A* algorithm"
showing 10 items of 2538 documents
The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem
2016
The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.
A data aggregation strategy based on wavelet for the internet of things
2017
The advent of emerging information and communication technologies, such as RFID, small size sensors and sensor networks, has made accessible a huge amount of information that requires sophisticated and efficient search algorithms to support queries on that data. In this paper we focus on the problem of aggregating data collected from these devices to efficiently support queries, inferences or statistics on them. In general, data aggregation techniques are necessary to efficiently collect information in a compact and cost-effective way. Some current solutions try to meet the above criteria, by exploiting different data aggregation techniques, for instance BitVector or Q_Digest. In this manus…
Strain localization and fracture in isotropic damaging materials: a novel augmented-finite element strategy
2022
An Iterative Approach to Dynamic Elastic-Plastic Analysis
1998
The step-by-step analysis of structures constituted by elastic-plastic finite elements, subjected to an assigned loading history, is here considered. The structure may possess dynamic and/or not dynamic degrees-of-freedom. As it is well-known, at each step of analysis the solution of a linear complementarity problem is required. An iterative method devoted to solving the relevant linear complementarity problem is presented. It is based on the recursive solution of a linear complementarity, problem in which the constraint matrix is block-diagonal and deduced from the matrix of the original linear complementarity problem. The convergence of the procedure is also proved. Some particular cases …
A relevance feedback CBIR algorithm based on fuzzy sets
2008
CBIR (content-based image retrieval) systems attempt to allow users to perform searches in large picture repositories. In most existing CBIR systems, images are represented by vectors of low level features. Searches in these systems are usually based on distance measurements defined in terms of weighted combinations of the low level features. This paper presents a novel approach to combining features when using multi-image queries consisting of positive and negative selections. A fuzzy set is defined so that the degree of membership of each image in the repository to this fuzzy set is related to the user's interest in that image. Positive and negative selections are then used to determine t…
A task scheduling algorithm for HPC applications using colored stochastic Petri Net models
2017
The increase in demand for High Performance Computing (HPC) scientific applications motivates the efforts to reduce costs of running these applications. The problem to solve is that of dynamical multi-criterial optimal scheduling of an application on a HPC platform with a high number of heterogeneous nodes. The solution proposed by the authors is a HPC hardware-software architecture that includes the infrastructure for two level (node and inter-node level) adaptive load balancing. The article presents the development of an Coloured Petri Net(CPN) for such an architecture. The model was used for the development of a dynamic distributed algorithm for the scheduling problem. The CPN allowed a …
A FAST Method to Achieve Flexible Production Programming Systems
2008
One of the main critical problems in manufacturing system domains is the production scheduling process, because an agile and reactive production planning and scheduling system is essential in manufacturing. The production scheduling process is a complex problem in which finding a suitable production scheduling can greatly increase the effectiveness of highly flexible production processes. Nevertheless, this high flexibility makes the production scheduling and acquisition of relevant data quite complicated. Therefore, there is a strong demand for a universal and flexible tool for production scheduling capable of increasing the utilization of resources and that supports a decision-making proc…
Concurrent and Distributed Projection through Local Interference for Wireless Sensor Networks
2012
In this paper we use a gossip algorithm to obtain the projection of the observed signal into a subspace of lower dimension. Gossip algorithms allow distributed, fast and efficient computations on a Wireless Sensor Network and they can be properly modified to evaluate the sought projection. By combining computation coding with gossip algorithms we proposed a novel strategy that leads to important saving on convergence time as well as exponentially decreasing energy consumption, as the size of the network increases.
A Note on the Local Minimum Problem in Wireless Sensor Networks
2013
The Local Minimum Problem occurs in geographic routing scenarios. In this paper two solutions to this problem for certain network topologies are proposed. By using the notion of virtual coordinates a theoretical and a practical constructions are presented. A distributed algorithm for the practical approach is proposed.
Solving NP-Complete Problems with Networks of Evolutionary Processors
2001
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NP-complete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher directions of research are finally discussed.