The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Indexing provides efficient way of storing and retrieving the data from the database by mapping with the respective records. Storing and Retrieving the data from the databases of various universities always requires efficient algorithms or procedures because of huge amount of student information stored. In order to retrieve and store data from the database in more efficient manner, customized indexing...
This study propose to extend performance analysis of mainly Brute force and Heuristics algorithms on tree search problems. The most important goal is to look for optimization by punching holes in existing theory. The outcome will give a new dimension to traditional values like formulation of intelligent and speculative searches with improvement in time and space complexities. A series of observations...
According to the research and analysis of auto-generating exam paper issues, identified auto-generating exam paper is a multi-objective constrained optimization problem, this paper puts forward mathematical models for auto-generating paper based on genetic algorithm. In this model, uses the properties of global-selecting-excellent and intelligent search of genetic arithmetic, on the basis of the every...
Since Volker Strassen proposed a recursive matrix multiplication algorithm reducing the time complexity to n2.81 in 1968, many scholars have done a lot of research on this basis. In recent years, researchers have proposed using computer algorithms to solve fast matrix multiplication problem. They have found Strassen's algorithm or other algorithms that have the same time complexity as Strassen algorithm...
A developed Dijkstra shortest path search algorithm is proposed through improving data structure, preprocessing to remove redundant vertices and setting the search region sequence. The average running time before and after improvement is compared and analyzed through the simulation tests. The results show that the developed Dijkstra shortest path search algorithm can improve storage efficiency and...
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumptions of closure under permutation and non-revisiting algorithms. We then propose a new approach to reasoning about search algorithm performance, treating search algorithms as stochastic processes and thereby admitting revisiting;...
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a four dimensional (4D) maximum entry search problem wherein each entry corresponds to the quality score of the subimage contained in a subwindow. For n × n images, a naive exhaustive search requires O(n4) sequential computations...
An efficient planning algorithm for the hexagonal metamorphic self-reconfiguring system (SRS) is presented. Empirically, the algorithm achieves an time complexity of O(n) averaged over random problem instances. The planning algorithm is capable of solving approximately 97% of planning tasks in the general state space of configurations containing less than 20,000 units. The state space is divided into...
With the increasing of the context, the time complexity and the space complexity of structuring concept lattice will be dramatically increased accordingly. The new method of enhancing the structuring efficiency has been paid much attention because it is the premise for being used in a large and complicated data system. So far, there are mainly two structuring methods, collocation and overlay of context...
As a practical method for knowledge reduction, discernible matrix (DM) has been widely used in practice. However, due to the high cost of constructing and reducing of a matrix, the efficiency of this method falls far short of people's demands. In order to decrease the cost of knowledge reduction based on the ideas of set theory, the paper presents a new approach, which is called the minimum discernible...
In this paper, we introduce one simple heuristic for value ordering in solving frequency assignment problem. Our approach is based on a special container to organize the values selection by jumping between two sides of domain. In order to reduce the time and space complexities of algorithm, we change the current value selection with last unchecked element in the domain, and put all the inconsistent...
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. JointBoost is a recently proposed method where OVA classifiers are trained jointly and are forced to share features. JointBoost has been demonstrated to lead both to higher accuracy and smaller classification time, compared...
This paper provides an improved search algorithm for optimal route planning by rebuilding the search area in intelligent transport system. The theory foundation is that the classical Dijsktra algorithm has not any directional feature during searching the optimal path, and the bidirectional Dijsktra has its own limit. Based on the analysis of the two algorithms, the new improved algorithm proposed...
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems.We consider the {\em approximate nearest neighbor search problem} on the Boolean hypercube $(\bool^d,\onenorm{\cdot})$ with $d=\Theta(\log n)$. We show that any (randomized) data structure for the problem that answers $c$-approximate nearest neighbor search queries using probes must use space...
A layered algorithm of bidirectional search is proposed for the problem of the route with multiple restrictions. The first step is to calculate the reachability set of path to each intermediate nodes using starting from the source nodes and the target nodes separately; and the second is to filtrate the path in the set. The reachability of paths can be obtained from the adjacent matrix transform, and...
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neighboring patches are treated. We present an approach that produces higher quality overlap regions than simple blending of patches or computing good boundaries, however, that is faster than resynthesizing invalid pixels using...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.