Search results for "A* algorithm"
showing 10 items of 2538 documents
Quantum-over-Classical Advantage in Solving Multiplayer Games
2020
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games.
Organized Learning Models (Pursuer Control Optimisation)
1982
Abstract The concept of Organized Learning is defined, and some random models are presented. For Not Transferable Learning, it is necessary to start from an instantaneous learning; by a discrete way, we must form a stochastic model considering the probability of each path; with a continue aproximation, we can study the evolution of the internal state through to consider the relative and absolute probabilities, by means of differential equations systems. For Transferable Learning, the instantaneous learning give us directly the System evolution. So, the Algoritmes for the different models are compared.
SVM approximation for real-time image segmentation by using an improved hyperrectangles-based method
2003
A real-time implementation of an approximation of the support vector machine (SVM) decision rule is proposed. This method is based on an improvement of a supervised classification method using hyperrectangles, which is useful for real-time image segmentation. The final decision combines the accuracy of the SVM learning algorithm and the speed of a hyperrectangles-based method. We review the principles of the classification methods and we evaluate the hardware implementation cost of each method. We present the combination algorithm, which consists of rejecting ambiguities in the learning set using SVM decision, before using the learning step of the hyperrectangles-based method. We present re…
Thompson Sampling for Dynamic Multi-armed Bandits
2011
The importance of multi-armed bandit (MAB) problems is on the rise due to their recent application in a large variety of areas such as online advertising, news article selection, wireless networks, and medicinal trials, to name a few. The most common assumption made when solving such MAB problems is that the unknown reward probability theta k of each bandit arm k is fixed. However, this assumption rarely holds in practice simply because real-life problems often involve underlying processes that are dynamically evolving. In this paper, we model problems where reward probabilities theta k are drifting, and introduce a new method called Dynamic Thompson Sampling (DTS) that facilitates Order St…
Extension of luminance component based demosaicking algorithm to 4- and 5-band multispectral images
2021
Abstract Multispectral imaging systems are currently expanding with a variety of multispectral demosaicking algorithms. But these algorithms have limitations due to the remarkable presence of artifacts in the reconstructed image. In this paper, we propose a powerful multispectral image demosaicking method that focuses on the G band and luminance component. We've first identified a relevant 4-and 5-band multispectral filter array (MSFA) with the dominant G band and then proposed an algorithm that consistently estimates the missing G values and other missing components using a convolution operator and a weighted bilinear interpolation algorithm based on the luminance component. Using the cons…
How does serendipity affect diversity in recommender systems? A serendipity-oriented greedy algorithm
2018
Most recommender systems suggest items that are popular among all users and similar to items a user usually consumes. As a result, the user receives recommendations that she/he is already familiar with or would find anyway, leading to low satisfaction. To overcome this problem, a recommender system should suggest novel, relevant and unexpected i.e., serendipitous items. In this paper, we propose a serendipity-oriented, reranking algorithm called a serendipity-oriented greedy (SOG) algorithm, which improves serendipity of recommendations through feature diversification and helps overcome the overspecialization problem. To evaluate our algorithm, we employed the only publicly available datase…
SCCF Parameter and Similarity Measure Optimization and Evaluation
2019
Neighborhood-based Collaborative Filtering (CF) is one of the most successful and widely used recommendation approaches; however, it suffers from major flaws especially under sparse environments. Traditional similarity measures used by neighborhood-based CF to find similar users or items are not suitable in sparse datasets. Sparse Subspace Clustering and common liking rate in CF (SCCF), a recently published research, proposed a tunable similarity measure oriented towards sparse datasets; however, its performance can be maximized and requires further analysis and investigation. In this paper, we propose and evaluate the performance of a new tuning mechanism, using the Mean Absolute Error (MA…
Approximate 3-Dimensional Electrical Impedance Imaging
2001
We discuss a new approach to three-dimensional electrical impedance imaging based on a reduction of the information to be demanded from a reconstruction algorithm. Images are obtained from a single measurement by suitably simplifying the geometry of the measuring chamber and by restricting the nature of the object to be imaged and the information required from the image. In particular we seek to establish the existence or non-existence of a single object (or a small number of objects) in a homogeneous background and the location of the former in the (x,y)-plane defined by the measuring electrodes. Given in addition the conductivity of the object rough estimates of its position along the z-a…
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
2007
Abstract Background Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. However, the alignment methods seem inadequate for post-genomic studies since they do not scale well with data set size and they seem to be confined only to genomic and proteomic sequences. Therefore, alignment-free similarity measures are actively pursued. Among those, USM (Universal Similarity Metric) has gained prominence. It is based on the deep theory of Kolmogorov Complexity and universality is its most novel striking feature. Since it can only be approximated via data compression, USM is a methodology rath…
Cryptanalysis of Knapsack Cipher Using Ant Colony Optimization
2018
Ant Colony Optimization is a search metaheuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of knapsack cipher algorithm. A Cipher-text only attack is used to discover the plaintext from the cipher-text. Moreover, our approach allows us to break knapsack cryptosystem in a minimum search space when compared with other techniques. Experimental results prove that ACO can be used as an effective tool to attack knapsack cipher.