Search results for "Algorithm"

showing 10 items of 4887 documents

Robust estimation of partial directed coherence by the vector optimal parameter search algorithm

2009

We propose a method for the accurate estimation of Partial Directed Coherence (PDC) from multichannel time series. The method is based on multivariate vector autoregressive (MVAR) model identification performed through the recently proposed Vector Optimal Parameter Search (VOPS) algorithm. Using Monte Carlo simulations generated by different MVAR models, the proposed VOPS algorithm is compared with the traditional Vector Least Squares (VLS) identification method. We show that the VOPS provides more accurate PDC estimates than the VLS (either overall and single-arc errors) in presence of interactions with long delays and missing terms, and for noisy multichannel time series. ©2009 IEEE.

Mathematical optimizationMultivariate statisticsNeuroscience (all)Parameter search algorithmComputer scienceEstimation theoryMonte Carlo methodSystem identificationPartial directed coherenceBiomedical EngineeringAC powerAutoregressive modelSearch algorithmVector autoregressive modelSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaCoherence (signal processing)Brain connectivityNeurology (clinical)Algorithm
researchProduct

Developing Domain-Knowledge Evolutionary Algorithms for Network-on-Chip Application Mapping

2013

This paper addresses the Network-on-Chip (NoC) application mapping problem. This is an NP-hard problem that deals with the optimal topological placement of Intellectual Property cores onto the NoC tiles. Network-on-Chip application mapping Evolutionary Algorithms are developed, evaluated and optimized for minimizing the NoC communication energy. Two crossover and one mutation operators are proposed. It is analyzed how each optimization algorithm performs with every genetic operator, in terms of solution quality and convergence speed. Our proposed operators are compared with state-of-the-art genetic operators for permutation problems. Finally, the problem is approached in a multi-objective w…

Mathematical optimizationMutation operatorTheoretical computer scienceComputer Networks and CommunicationsComputer scienceQuality control and genetic algorithmsCrossoverEvolutionary algorithmGenetic operatorMulti-objective optimizationNetwork on a chipArtificial IntelligenceHardware and ArchitectureSimulated annealingGenetic algorithmGenetic representationSoftwareMicroprocessors and Microsystems
researchProduct

A multi-objective strategy for concurrent mapping and routing in networks on chip

2009

The design flow of network-on-chip (NoCs) include several key issues. Among other parameters, the decision of where cores have to be topologically mapped and also the routing algorithm represent two highly correlated design problems that must be carefully solved for any given application in order to optimize several different performance metrics. The strong correlation between the different parameters often makes that the optimization of a given performance metric has a negative effect on a different performance metric. In this paper we propose a new strategy that simultaneously refines the mapping and the routing function to determine the Pareto optimal configurations which optimize averag…

Mathematical optimizationNetwork on a chipRobustness (computer science)Computer scienceMultipath routingAlgorithm designFault toleranceNetwork topologyMulti-objective optimization2009 IEEE International Symposium on Parallel & Distributed Processing
researchProduct

A note on the Bregmanized Total Variation and dual forms

2009

This paper considers two approaches to perform image restoration while preserving the contrast. The first one is the Total Variation-based Bregman iterations while the second consists in the minimization of an energy that involves robust edge preserving regularization. We show that these two approaches can be derived form a common framework. This allows us to deduce new properties and to extend and generalize these two previous approaches.

Mathematical optimizationNoise measurementIterative methodCommon frameworkMinificationTotal variation denoisingAlgorithmRegularization (mathematics)Image restorationMathematics2009 16th IEEE International Conference on Image Processing (ICIP)
researchProduct

Error bounds for a convexity-preserving interpolation and its limit function

2008

AbstractError bounds between a nonlinear interpolation and the limit function of its associated subdivision scheme are estimated. The bounds can be evaluated without recursive subdivision. We show that this interpolation is convexity preserving, as its associated subdivision scheme. Finally, some numerical experiments are presented.

Mathematical optimizationNonlinear subdivision schemesbusiness.industryApplied MathematicsNumerical analysisMathematicsofComputing_NUMERICALANALYSISStairstep interpolationComputer Science::Computational GeometryConvexityMultivariate interpolationComputational MathematicsError boundsComputer Science::GraphicsNearest-neighbor interpolationTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONApplied mathematicsComputer Science::Symbolic ComputationConvexity preservingbusinessSpline interpolationSubdivisionInterpolationMathematicsComputingMethodologies_COMPUTERGRAPHICSJournal of Computational and Applied Mathematics
researchProduct

Geometric constraint solving: The witness configuration method

2006

Geometric constraint solving is a key issue in CAD, CAM and PLM. The systems of geometric constraints are today studied and decomposed with graph-based methods, before their numerical resolution. However, graph-based methods can detect only the simplest (called structural) dependences between constraints; they cannot detect subtle dependences due to theorems. To overcome these limitations, this paper proposes a new method: the system is studied (with linear algebra tools) at a witness configuration, which is intuitively similar to the unknown one, and easy to compute.

Mathematical optimizationNumerical resolutionLinear algebraGraph (abstract data type)CADRigidity theoryComputer Graphics and Computer-Aided DesignAlgorithmWitnessIndustrial and Manufacturing EngineeringComputer Science ApplicationsMathematicsComputer-Aided Design
researchProduct

Surrogate-Assisted Evolutionary Optimization of Large Problems

2019

This chapter presents some recent advances in surrogate-assisted evolutionary optimization of large problems. By large problems, we mean either the number of decision variables is large, or the number of objectives is large, or both. These problems pose challenges to evolutionary algorithms themselves, constructing surrogates and surrogate management. To address these challenges, we proposed two algorithms, one called kriging-assisted reference vector guided evolutionary algorithm (K-RVEA) for many-objective optimization, and the other called cooperative swarm optimization algorithm (SA-COSO) for high-dimensional single-objective optimization. Empirical studies demonstrate that K-RVEA works…

Mathematical optimizationOptimization algorithmoptimisationComputer scienceEvolutionary algorithmSwarm behaviourevoluutiolaskenta02 engineering and technologymatemaattinen optimointimathematical optimisationDecision variablesEmpirical researchoptimointievolutionary computation0202 electrical engineering electronic engineering information engineeringReference vector020201 artificial intelligence & image processing
researchProduct

Joint Optimization of Detection Threshold and Resource Allocation in Infrastructure-based Multi-band Cognitive Radio Networks

2012

[EN] Consider an infrastructure-based multi-band cognitive radio network (CRN) where secondary users (SUs) opportunistically access a set of sub-carriers when sensed as idle. The carrier sensing threshold which affects the access opportunities of SUs is conventionally regarded as static and treated independently from the resource allocation in the model. In this article, we study jointly the optimization of detection threshold and resource allocation with the goal of maximizing the total downlink capacity of SUs in such CRNs. The optimization problem is formulated considering three sets of variables, i.e., detection threshold, sub-carrier assignment and power allocation, with constraints on…

Mathematical optimizationOptimization problemComputer scienceComputer Networks and Communications020208 electrical & electronic engineeringReal-time computing020206 networking & telecommunications02 engineering and technologyINGENIERIA TELEMATICAPower budgetComputer Science ApplicationsMulti-band cognitive radio networksBase stationCognitive radioTelecommunications linkSignal Processing0202 electrical engineering electronic engineering information engineeringResource allocationOnline algorithmResource allocationOptimization of detection threshold
researchProduct

A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization

2019

Many-objective optimization problems (MaOPs) contain four or more conflicting objectives to be optimized. A number of efficient decomposition-based evolutionary algorithms have been developed in the recent years to solve them. However, computationally expensive MaOPs have been scarcely investigated. Typically, surrogate-assisted methods have been used in the literature to tackle computationally expensive problems, but such studies have largely focused on problems with 1–3 objectives. In this paper, we present an approach called hybrid surrogate-assisted many-objective evolutionary algorithm to solve computationally expensive MaOPs. The key features of the approach include: 1) the use of mul…

Mathematical optimizationOptimization problemComputer scienceEvolutionary algorithmPareto principle02 engineering and technologyEvolutionary computationTheoretical Computer ScienceConstraint (information theory)Set (abstract data type)Range (mathematics)Computational Theory and Mathematics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingHeuristicsSoftwareIEEE Transactions on Evolutionary Computation
researchProduct

Some Aspects Regarding the Application of the Ant Colony Meta-heuristic to Scheduling Problems

2010

Scheduling is one of the most complex problems that appear in various fields of activity, from industry to scientific research, and have a special place among the optimization problems In our paper we present the results of our computational study i.e an Ant Colony Optimization algorithm for the Resource-Constrained Project Scheduling Problem that uses dynamic pheromone evaporation.

Mathematical optimizationOptimization problemComputer scienceNurse scheduling problemAnt colony optimization algorithmsMeta heuristicAnt colonyComputingMethodologies_ARTIFICIALINTELLIGENCEMembrane computingMetaheuristicScheduling (computing)
researchProduct