Skip to search formSkip to main contentSkip to account menu

Continuous optimization

Continuous optimization is a branch of optimization in applied mathematics. As opposed to discrete optimization, the variables used in the objective… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Bees algorithmCMA-ESCross-entropy methodDiscrete optimization

Broader (1)

Mathematical optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
2016 Energy-Efficient Resource Allocation for Multi-User Mobile Edge Computing
— To increase mobile batteries’ lifetime and improve quality of experience for computation-intensive and latency-sensitive… 
2016
2016
An Efficient Hybrid Algorithm Based on HS and SFLA
When used for optimizing complex functions, harmony search (HS) and shuffled frog leaping algorithm (SFLA) algorithm tend to… 
Highly Cited
2014
Highly Cited
2014
Dynamic power management in energy-aware computer networks and data intensive computing systems
2012
2012
GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization
2012
2012
Optimum multi-camera arrangement using a bee colony algorithm
This paper presents a new method for designing multi-camera arrangements with aim to maximize coverage with the minimum number of… 
2010
2010
BBOB 2009: Comparison Tables of All Algorithms on All Noiseless Functions
This document presents the results in the form of tables from the Black-Box Optimization Benchmarking (BBOB) workshop of the… 
2007
2007
Digital Human Modeling for Design and Evaluation of Human-Machine Systems
Digital Human Modeling is an emerging area that bridges computer-aided engineering design, human factors engineering and applied… 
2007
2007
Covariance matrix repairing in Gaussian based EDAs
Gaussian models are widely adopted in continuous Estimation of Distribution Algorithms (EDAs). In this paper, we analyze… 
2006
2006
A divide-and-conquer local search heuristic for data visualization
2000
2000
Optimization of mistuned bladed discs using gradient-based response surface approximations
The problem of searching for the best arrangement of mistuned blades on a bladed disc is formulated and solved as a combinatorial… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)