Search results for "algoritmit"

showing 10 items of 118 documents

Interest-based topology management in unstructured peer-to-peer networks

2012

P2Pverkkotopologiatiedonhakujärjestelmätneuroverkottiedonsiirtopeer-to-peer networksoverlay topologyvertaisverkotoptimointialgoritmittopology managementself-organizingsimulointitietoverkotresource discovery
researchProduct

A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization

2018

We propose a surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed evolutionary algorithm for many-objective optimization that relies on a set of adaptive reference vectors for selection. The proposed surrogateassisted evolutionary algorithm uses Kriging to approximate each objective function to reduce the computational cost. In managing the Kriging models, the algorithm focuses on the balance of diversity and convergence by making use of the uncertainty information in the approximated objective values given by the Kriging models, the distr…

Pareto optimalityPareto-tehokkuus0209 industrial biotechnologyMathematical optimizationOptimization problemComputer sciencemodel managementpäätöksentekoEvolutionary algorithmInteractive evolutionary computation02 engineering and technologyEvolutionary computationTheoretical Computer Science020901 industrial engineering & automationKrigingalgoritmit0202 electrical engineering electronic engineering information engineeringvektorit (matematiikka)multiobjective optimizationcomputational costsurrogate-assisted evolutionary algorithmsBayesian optimizationta113Cultural algorithmpareto-tehokkuusbayesilainen menetelmäta111Approximation algorithmImperialist competitive algorithmmonitavoiteoptimointiKrigingkoneoppiminenComputational Theory and Mathematics020201 artificial intelligence & image processingreference vectorsSoftwareIEEE Transactions on Evolutionary Computation
researchProduct

Handling expensive multiobjective optimization problems with evolutionary algorithms

2017

Multiobjective optimization problems (MOPs) with a large number of conflicting objectives are often encountered in industry. Moreover, these problem typically involve expensive evaluations (e.g. time consuming simulations or costly experiments), which pose an extra challenge in solving them. In this thesis, we first present a survey of different methods proposed in the literature to handle MOPs with expensive evaluations. We observed that most of the existing methods cannot be easily applied to problems with more than three objectives. Therefore, we propose a Kriging-assisted reference vector guided evolutionary algorithm (K-RVEA) for problems with at least three expensive objectives. The alg…

Pareto optimalitymany-objective optimizationoptimointipareto-tehokkuusalgoritmitmetamodellingsurrogateevoluutiolaskentamatemaattinen optimointimonitavoiteoptimointicomputational costdecision making
researchProduct

On solving computationally expensive multiobjective optimization problems with interactive methods

2014

Pareto-tehokkuusPareto optimalityinteractive multiobjective optimizationmatemaattinen optimointimonitavoiteoptimointilaskennallinen vaativuusmenetelmätPareto-optimointioptimointialgoritmitinteraktiiviset optimointimenetelmätNIMBUS methodsoftware implementationcomputational cost
researchProduct

Simulation of matrix product states for dissipation and thermalization dynamics of open quantum systems

2020

Abstract We transform the system/reservoir coupling model into a one-dimensional semi-infinite discrete chain through unitary transformation to simulate the open quantum system numerically with the help of time evolving block decimation (TEBD) algorithm. We apply the method to study the dynamics of dissipative systems. We also generate the thermal state of a multimode bath using minimally entangled typical thermal state (METTS) algorithm, and investigate the impact of the thermal bath on an empty system. For both cases, we give an extensive analysis of the impact of the modeling and simulation parameters, and compare the numerics with the analytics.

Physicsopen quantum systemthermal bathDynamics (mechanics)General Physics and AstronomyDissipationtime-evolving block decimation algorithm01 natural sciences114 Physical sciencesMatrix multiplication010305 fluids & plasmasOpen quantum systemThermalisationQuantum mechanicsalgoritmit0103 physical sciencesminimally entangled typical thermal stateskvanttifysiikka010306 general physicsQuantum
researchProduct

Assessment of Classifiers and Remote Sensing Features of Hyperspectral Imagery and Stereo-Photogrammetric Point Clouds for Recognition of Tree Specie…

2018

Recognition of tree species and geospatial information on tree species composition is essential for forest management. In this study, tree species recognition was examined using hyperspectral imagery from visible to near-infrared (VNIR) and short-wave infrared (SWIR) camera sensors in combination with a 3D photogrammetric canopy surface model based on RGB camera stereo-imagery. An arboretum with a diverse selection of 26 tree species from 14 genera was used as a test area. Aerial hyperspectral imagery and high spatial resolution photogrammetric color imagery were acquired from the test area using unmanned aerial vehicle (UAV) borne sensors. Hyperspectral imagery was processed to calibrated …

Reflectance calibration010504 meteorology & atmospheric sciencesInfraredComputer sciencegeneettiset algoritmitUAVta1171Point clouddense point cloud01 natural scienceshyperspectral imagery; tree species recognition; photogrammetry; dense point cloud; reflectance calibration; UAV; random forest; genetic algorithm; machine learningilmakuvakartoitusMachine learninggenetic algorithmImage sensorfotogrammetria0105 earth and related environmental sciencesRemote sensingta113040101 forestryta213tree species recognitionspektrikuvausSpecies diversityHyperspectral imaging04 agricultural and veterinary sciencesOtaNanoreflectance calibrationDense point cloudVNIRRandom forestTree (data structure)hyperspectral imagerykoneoppiminenPhotogrammetryGenetic algorithmHyperspectral imageryPhotogrammetryTree species recognitionlajinmääritys0401 agriculture forestry and fisheriesGeneral Earth and Planetary SciencesRGB color modelkaukokartoituspuustorandom forestRandom forestRemote Sensing; Volume 10; Issue 5; Pages: 714
researchProduct

Adapting to Dynamic LEO-B5G Systems : Meta-Critic Learning Based Efficient Resource Scheduling

2022

Low earth orbit (LEO) satellite-assisted communications have been considered as one of key elements in beyond 5G systems to provide wide coverage and cost-efficient data services. Such dynamic space-terrestrial topologies impose exponential increase in the degrees of freedom in network management. In this paper, we address two practical issues for an over-loaded LEO-terrestrial system. The first challenge is how to efficiently schedule resources to serve the massive number of connected users, such that more data and users can be delivered/served. The second challenge is how to make the algorithmic solution more resilient in adapting to dynamic wireless environments.To address them, we first…

Signal Processing (eess.SP)FOS: Computer and information sciencesdynamic environmentComputer Science - Machine Learningreinforcement learningmeta-critic learningComputer Science - Artificial Intelligence5G-tekniikkaresursointiMachine Learning (cs.LG): Electrical & electronics engineering [C06] [Engineering computing & technology]LEO satelliteslangaton tiedonsiirtoresources allocationalgoritmitFOS: Electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringElectrical Engineering and Systems Science - Signal Processing: Ingénierie électrique & électronique [C06] [Ingénierie informatique & technologie]Applied MathematicstietoliikennesatelliititComputer Science ApplicationsArtificial Intelligence (cs.AI)koneoppiminenresource schedulinglangattomat verkot
researchProduct

Energy Efficiency Optimization for Multi-cell Massive MIMO : Centralized and Distributed Power Allocation Algorithms

2021

This paper investigates the energy efficiency (EE) optimization in downlink multi-cell massive multiple-input multiple-output (MIMO). In our research, the statistical channel state information (CSI) is exploited to reduce the signaling overhead. To maximize the minimum EE among the neighbouring cells, we design the transmit covariance matrices for each base station (BS). Specifically, optimization schemes for this max-min EE problem are developed, in the centralized and distributed ways, respectively. To obtain the transmit covariance matrices, we first find out the closed-form optimal transmit eigenmatrices for the BS in each cell, and convert the original transmit covariance matrices desi…

Signal Processing (eess.SP)FOS: Computer and information sciencesmallintaminenComputational complexity theoryComputer scienceenergiatehokkuusComputer Science - Information TheoryMIMO02 engineering and technologyPrecoding0203 mechanical engineeringoptimointistatistical CSIalgoritmit0202 electrical engineering electronic engineering information engineeringFOS: Electrical engineering electronic engineering information engineeringOverhead (computing)Electrical and Electronic EngineeringElectrical Engineering and Systems Science - Signal Processingenergy efficiencymax-min fairnessInformation Theory (cs.IT)020206 networking & telecommunications020302 automobile design & engineeringmulti-cell MIMOCovarianceDistributed algorithmChannel state informationConvex optimizationdistributed processingAlgorithm
researchProduct

JSN määritteli algoritmit osaksi journalistista työtä

2019

Social sciences (General)H1-99Communication. Mass mediaalgoritmitjournalismiP87-96AjankohtaistaJournalism. The periodical press etc.PN4699-5650Media & viestintä
researchProduct

Establishing some order amongst exact approximations of MCMCs

2016

Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard MCMC algorithms, such as the target probability density in a Metropolis-Hastings algorithm, with estimators. Perhaps surprisingly, such approximations lead to powerful algorithms which are exact in the sense that they are guaranteed to have correct limiting distributions. In this paper we discover a general framework which allows one to compare, or order, performance measures of two implementations of such algorithms. In particular, we establish an order …

Statistics and ProbabilityFOS: Computer and information sciences65C05Mathematical optimizationMonotonic function01 natural sciencesStatistics - ComputationPseudo-marginal algorithm010104 statistics & probabilitysymbols.namesake60J05martingale couplingalgoritmitFOS: MathematicsApplied mathematics60J220101 mathematicsComputation (stat.CO)Mathematics65C40 (Primary) 60J05 65C05 (Secondary)Martingale couplingMarkov chainmatematiikkapseudo-marginal algorithm010102 general mathematicsProbability (math.PR)EstimatorMarkov chain Monte Carloconvex orderDelta methodMarkov chain Monte CarloOrder conditionsymbolsStatistics Probability and UncertaintyAsymptotic variance60E15Martingale (probability theory)Convex orderMathematics - ProbabilityGibbs sampling
researchProduct