Computing Finite Size Representations of the Set of Approximate Solutions of an MOP With Stochastic Search Algorithms

doi 10.1145/1389095.1389233
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Computing Irreducible Representations of Finite Groups

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1990English

Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms

Annals of Information Systems
2009English

Stochastic Algorithms for Exact and Approximate Feasibility of Robust LMIs

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2001English

The Divergence Behavior of Adaptive Signal Processing Algorithms With Finite Search Horizon

2016English

On Improving Approximate Solutions by Evolutionary Algorithms

2007English

Some Remarks on the Extension of a Finite Set of Stochastic Automata

Applicationes Mathematicae
1975English

A Note on Euler-Maruyama’s Approximate Solutions of Stochastic Differential Equations

Nonlinear Analysis and Differential Equations
2014English

Finite-Size Analysis of the Detectability Limit of the Stochastic Block Model

Physical review. E
Nonlinear PhysicsProbabilityStatisticsCondensed Matter PhysicsStatistical
2017English

Efficiency Comparison of Exact and Approximate Algorithms for Solving Set Covering Problem

Vestnik of Don State Technical University
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy