Search results for "approximation error"

showing 10 items of 62 documents

On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods

2021

Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when several solving applications are available. In this article, we study the impact of the structure of a Traveling Salesman Problem instance on the quality of the solution when using two representative heuristics: the population-based Ant Colony Optimization (ACO) and the local search Lin-Kernighan (LK) algorithm. The quality of the result for a solving method is measured by the computation accuracy, which is expressed using the percent error between its soluti…

Mathematical optimizationGeneral Computer ScienceComputer scienceHeuristic (computer science)Population0211 other engineering and technologies02 engineering and technologyTravelling salesman problemAnt colony optimizationApproximation error0202 electrical engineering electronic engineering information engineeringGeneral Materials ScienceLocal search (optimization)Electrical and Electronic EngineeringeducationRandomnessLin-Kernighan methodeducation.field_of_study021103 operations researchEuclidean normHeuristicbusiness.industryAnt colony optimization algorithmstraveling salesman problemGeneral EngineeringApproximation algorithm020201 artificial intelligence & image processinglcsh:Electrical engineering. Electronics. Nuclear engineeringHeuristicsbusinesslcsh:TK1-9971IEEE Access
researchProduct

On central algorithms of approximation under fuzzy information

2005

We consider the problem of approximation of an operator by information described by n real characteristics in the case when this information is fuzzy. We develop the well-known idea of an optimal error method of approximation for this case. It is a method whose error is the infimum of the errors of all methods for a given problem characterized by fuzzy numbers in this case. We generalize the concept of central algorithms, which are always optimal error algorithms and in the crisp case are useful both in practice and in theory. In order to do this we define the centre of an L-fuzzy subset of a normed space. The introduced concepts allow us to describe optimal methods of approximation for lin…

Mathematical optimizationFuzzy classificationArtificial IntelligenceLogicApproximation errorFuzzy setFuzzy set operationsFuzzy numberApproximation algorithmRound-off errorAlgorithmFuzzy logicMathematicsFuzzy Sets and Systems
researchProduct

Proximal-sensing-powered modelling of energy-water fluxes in a vineyard: A spatial resolution analysis

2021

Spatial resolution is a key parameter in energy–water surface flux modelling. In this research, scale effects are analyzed on fluxes modelled with the FEST-EWB model, by upscaling both its inputs and outputs separately. The main questions are: (a) if high-resolution remote sensing images are necessary to accurately model a heterogeneous area; and (b) whether and to what extent low-resolution modelling provides worse/better results than the upscaled results of high-resolution modelling. The study area is an experimental vineyard field where proximal sensing images were obtained by an airborne platform and verification fluxes were measured via a flux tower. Modelled fluxes are in line with th…

Spatial resolutionPixelEvapotranspirationEnergy-balance modelScienceQVineyardSpatial heterogeneityFlux (metallurgy)Approximation errorEvapotranspirationUpscalingCalibrationGeneral Earth and Planetary SciencesEnvironmental scienceImage resolutionEnergy (signal processing)Settore ICAR/06 - Topografia E CartografiaRemote sensing
researchProduct

Error and Uncertainty Analysis of the Residual Stresses Computed by Using the Hole Drilling Method

2010

:  The hole-drilling method is one of the most used techniques for the experimental analysis of the residual stresses in mechanical components. For both through-thickness uniform and non-uniform residual stress distributions, its application is standardised by the ASTM E837-08. In accordance with the ASTM limitations, the analysis of uniform residual stresses, to which the present work deals with, leads in general to results with a maximum bias of about 10%. Unfortunately, in general the user does not have appropriate procedures to estimate the actual stress error; consequently, if one or more of the experimental influence parameters fall out of the corresponding standard limitations, the c…

Hole drilling methodEngineeringWork (thermodynamics)business.industryMechanical EngineeringStructural engineeringReliability engineeringStress (mechanics)Mechanics of MaterialsApproximation errorResidual stressCode (cryptography)MATLABbusinesscomputerUncertainty analysiscomputer.programming_languageStrain
researchProduct

Solution of coupled riccati equations occurring in nash games

2006

To obtain the open-loop Nash strategy for a linear-quadratic differential game, a set of coupled matrix Riccati equations has to be solved. It is shown that by means of algebraic transformations, the original problem can be reduced to another one to which the successive approximation method is applicable. This leads to a simple iterative algorithm with a predetermined approximation error. An example is given to illustrate the proposed method.

Matrix (mathematics)Simple (abstract algebra)Iterative methodApproximation errorComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONDifferential gameMatrix normRiccati equationApplied mathematicsMathematical economicsAlgebraic Riccati equationMathematics
researchProduct

Connections Between Topology and Macroscopic Mechanical Properties of Three-Dimensional Open-Pore Materials

2018

This work addresses a number of fundamental questions regarding the topological description of materials characterized by a highly porous three-dimensional structure with bending as the major deformation mechanism. Highly efficient finite-element beam models were used for generating data on the mechanical behavior of structures with different topologies, ranging from highly coordinated bcc to Gibson–Ashby structures. Random cutting enabled a continuous modification of average coordination numbers ranging from the maximum connectivity to the percolation-cluster transition of the 3D network. The computed macroscopic mechanical properties–Young's modulus, yield strength, and Poisson's ratio–co…

Work (thermodynamics)Materials sciencetopologyMaterials Science (miscellaneous)Coordination numberModulus02 engineering and technologyBendingPoisson distributionTopologystructure–property relationship01 natural scienceslcsh:Technologysymbols.namesakeApproximation error0103 physical sciencesTechnik [600]Topology (chemistry)ddc:620.11010302 applied physicslcsh:T600data mining021001 nanoscience & nanotechnologyelastic-plastic deformation behaviormachine learningopen-pore materialssymbols0210 nano-technologyReduction (mathematics)ddc:600Frontiers in Materials
researchProduct

Scheduling under the network of temporo-spatial proximity relationships

2017

We discuss and introduce to the schedulingeld a novel, qualitative optimization model - scheduling under the network of temporo-spatial proximity relationships.We introduce a half perimeter proximity measure as an objective of scheduling.We present and evaluate an incremental Sequence Pair neighborhood evaluation algorithm, applicable to both scheduling and rectangle packing problems in VLSI industry. In this paper, we discuss and introduce to the scheduling field a novel optimization objective - half perimeter proximity measure in scheduling under the network of temporo-spatial proximity relationships. The presented approach enables to qualitatively express various reasons of scheduling ce…

proximity relationshipsMathematical optimizationGeneral Computer Sciencerectangle packing problemEvaluation algorithm0102 computer and information sciences02 engineering and technologyIntegrated circuitManagement Science and Operations Research01 natural scienceslaw.inventionScheduling (computing)lawApproximation error0202 electrical engineering electronic engineering information engineeringschedulingComputer Science::Operating SystemsMathematicsVery-large-scale integrationProximity measureneighborhood evaluation010201 computation theory & mathematicsModeling and Simulation020201 artificial intelligence & image processingsequence pairRectangle packingComputers & Operations Research
researchProduct

Sequential Learning with LS-SVM for Large-Scale Data Sets

2006

We present a subspace-based variant of LS-SVMs (i.e. regularization networks) that sequentially processes the data and is hence especially suited for online learning tasks. The algorithm works by selecting from the data set a small subset of basis functions that is subsequently used to approximate the full kernel on arbitrary points. This subset is identified online from the data stream. We improve upon existing approaches (esp. the kernel recursive least squares algorithm) by proposing a new, supervised criterion for the selection of the relevant basis functions that takes into account the approximation error incurred from approximating the kernel as well as the reduction of the cost in th…

Data streamSupport vector machineApproximation errorBasis functionSequence learningLarge scale dataAlgorithmRegularization (mathematics)Subspace topologyMathematics
researchProduct

Influence of pixel size on quantification of airway wall thickness in computed tomography.

2009

Objectives: The purpose of this study was to determine the point where a further decrease in voxel size does not result in better automatic quantification of the bronchial wall thickness by using 2 different assessment techniques. Materials and Methods: The results from the commonly used full-width-at-half-maximum (FWHM) principle and a new technique (integral-based method [IBM]) were compared for thin-section multidetector computed tomography (MDCT) data sets from an airway phantom containing 10 different tubular airway phantoms and in a human subsegmental bronchus in vivo. Correlation with the actual wall thickness and comparison of the wall thicknesses assessed for different voxel sizes …

Pixelmedicine.diagnostic_testbusiness.industryPhantoms ImagingComputed tomographyField of viewBronchiBronchographycomputer.software_genreImaging phantomRadiographic Image EnhancementFull width at half maximumVoxelApproximation errorComputer GraphicsMedicineHumansRadiographic Image Interpretation Computer-AssistedRadiology Nuclear Medicine and imagingbusinessNuclear medicineTomography X-Ray ComputedImage resolutioncomputerSoftwareJournal of computer assisted tomography
researchProduct

Upper Bound for the Approximation Error for the Kirchhoff-Love Arch Problem

2013

In this paper, a guaranteed and computable upper bound of approximation errors for the Kirchhoff-Love arch problem is derived. In general, it belongs to the class of functional a posteriori error estimates. The derivation method uses purely functional arguments and, therefore, the estimates are valid for any conforming approximation within the energy space. The computational implementation of the upper bound is discussed and demonstrated by a numerical example.

Class (set theory)Approximation errorA priori and a posterioriApplied mathematicsDerivation methodArchSpace (mathematics)Upper and lower boundsEnergy (signal processing)Mathematics
researchProduct