Search results for "A* algorithm"
showing 10 items of 2538 documents
On the stability and ergodicity of adaptive scaling Metropolis algorithms
2011
The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.
Eleccion de variables en regresion lineal un problema de decision
1986
A general structure for the problem of selection of variables in regression is proposed using the decision theory framework. In particular, some results for the choice of the best linear normal homocedastic model are obtained when the main purpose is either to specify the predictive distribution over the response variable or to obtain a point estimate of it. A comparison of our results with the most widespread classical ones is presented
Diseño muestral optimo en el caso de no respuesta
1982
Discussed here are several aspects of a simple model for dealing with nonresponse. The model is, in a sense, a sequential one and is developed from a Bayesian decision theory point of view. Within this framework we examine how formalization and combination of one's opinions, and past experience concerning the proportion of nonrespondents, the differences and relations between respondents and nonrespondents, the cost of obtaining information from nonrespondents, etc. We examine the decisions concerning the selection of sampling size m and n, both in the nonrespondent population and in the overall population
Contributed discussion on article by Pratola
2016
The author should be commended for his outstanding contribution to the literature on Bayesian regression tree models. The author introduces three innovative sampling approaches which allow for efficient traversal of the model space. In this response, we add a fourth alternative.
Steady-state and tracking analysis of a robust adaptive filter with low computational cost
2007
This paper analyses a new adaptive algorithm that is robust to impulse noise and has a low computational load [E. Soria, J.D. Martin, A.J. Serrano, J. Calpe, and J. Chambers, A new robust adaptive algorithm with low computacional cost, Electron. Lett. 42 (1) (2006) 60-62]. The algorithm is based on two premises: the use of the cost function often used in independent component analysis and a fuzzy modelling of the hyperbolic tangent function. The steady-state error and tracking capability of the algorithm are analysed using conservation methods [A. Sayed, Fundamentals of Adaptive Filtering, Wiley, New York, 2003], thus verifying the correspondence between theory and experimental results.
Stochastic algorithms for robust statistics in high dimension
2016
This thesis focus on stochastic algorithms in high dimension as well as their application in robust statistics. In what follows, the expression high dimension may be used when the the size of the studied sample is large or when the variables we consider take values in high dimensional spaces (not necessarily finite). In order to analyze these kind of data, it can be interesting to consider algorithms which are fast, which do not need to store all the data, and which allow to update easily the estimates. In large sample of high dimensional data, outliers detection is often complicated. Nevertheless, these outliers, even if they are not many, can strongly disturb simple indicators like the me…
Registration and fusion of segmented left atrium CT images with CARTO electrical maps for the ablative treatment of atrial fibrillation
2005
This study aims to extract the interior surface of the left atrium (LA) and pulmonary veins (PVs) from threedimensional tomographic data and to integrate it with LA CARTO electrical maps. The separation of LA and PVs from other overlapping structures of the heart was performed processing 3D CT data by marker-controlled watershed segmentation and surface extraction. CARTO maps were then registered on the L A internal surface by a stochastic optimization algorithm based on simulated annealing. The residual registration error resulted inferior to 3 mm. The integration between electrophysiological and high resolved anatomic information of LA results feasible and may constitute a significant sup…
Adaptive Wavelet Methods for SPDEs
2014
We review a series of results that have been obtained in the context of the DFG-SPP 1324 project “Adaptive wavelet methods for SPDEs”. This project has been concerned with the construction and analysis of adaptive wavelet methods for second order parabolic stochastic partial differential equations on bounded, possibly nonsmooth domains \(\mathcal{O}\subset \mathbb{R}^{d}\). A detailed regularity analysis for the solution process u in the scale of Besov spaces \(B_{\tau,\tau }^{s}(\mathcal{O})\), 1∕τ = s∕d + 1∕p, α > 0, p ≥ 2, is presented. The regularity in this scale is known to determine the order of convergence that can be achieved by adaptive wavelet algorithms and other nonlinear appro…
Memetic algorithms and memetic computing optimization: A literature review
2012
Abstract Memetic computing is a subject in computer science which considers complex structures such as the combination of simple agents and memes, whose evolutionary interactions lead to intelligent complexes capable of problem-solving. The founding cornerstone of this subject has been the concept of memetic algorithms, that is a class of optimization algorithms whose structure is characterized by an evolutionary framework and a list of local search components. This article presents a broad literature review on this subject focused on optimization problems. Several classes of optimization problems, such as discrete, continuous, constrained, multi-objective and characterized by uncertainties…
Firefly algorithm based upon slicing structure encoding for unequal facility layout problem
2019
Finding the locations of departments or machines in a workspace is classified as a Facility Layout Problem. Good placement of departments has a relevant influence on manufacturing costs, work in process, lead times and production efficiency. This paper analyses the problem of allocating departments with restrictions in terms of unequal area and rectangular shape within a facility, in order to minimize the sum of material handling costs taking into account the satisfaction of the aspect ratio requested. In particular, we propose for the first time a Firefly Algorithm based on the slicing structure encoding. The proposed method was tested comparing the results obtained from other authors on t…