A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut
Abstract
Supplementary Material
- Download
- 692.77 KB
References
Index Terms
- A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut
Recommendations
Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax
The Univariate Marginal Distribution Algorithm (UMDA) is a randomized search heuristic that builds a stochastic model of the underlying optimization problem by repeatedly sampling $$\lambda $$ý solutions and adjusting the model according to the best $$\...
Fitness levels with tail bounds for the analysis of randomized search heuristics
The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Funding Sources
- SERB, India
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 62Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in