找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Experimental Methods for the Analysis of Optimization Algorithms; Thomas Bartz-Beielstein,Marco Chiarandini,Mike Pre Book 2010 Springer-Ve

[復(fù)制鏈接]
查看: 47119|回復(fù): 53
樓主
發(fā)表于 2025-3-21 19:56:00 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms
編輯Thomas Bartz-Beielstein,Marco Chiarandini,Mike Pre
視頻videohttp://file.papertrans.cn/319/318874/318874.mp4
概述First book to offer full treatment on this subject.Contributor include leading scientists in algorithm design, statistical design, optimization and heuristics.Most chapters provide theoretical backgro
圖書(shū)封面Titlebook: Experimental Methods for the Analysis of Optimization Algorithms;  Thomas Bartz-Beielstein,Marco Chiarandini,Mike Pre Book 2010 Springer-Ve
描述.In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. .This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scien
出版日期Book 2010
關(guān)鍵詞Algorithm engineering; Algorithms; Combinatorial optimization; Evolutionary algorithms; Experiment desig
版次1
doihttps://doi.org/10.1007/978-3-642-02538-9
isbn_softcover978-3-642-44590-3
isbn_ebook978-3-642-02538-9
copyrightSpringer-Verlag Berlin Heidelberg 2010
The information of publication is updating

書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms影響因子(影響力)




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms影響因子(影響力)學(xué)科排名




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms被引頻次




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms被引頻次學(xué)科排名




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms年度引用




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms年度引用學(xué)科排名




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms讀者反饋




書(shū)目名稱Experimental Methods for the Analysis of Optimization Algorithms讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:10:46 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:05:15 | 只看該作者
地板
發(fā)表于 2025-3-22 04:48:50 | 只看該作者
5#
發(fā)表于 2025-3-22 11:51:33 | 只看該作者
6#
發(fā)表于 2025-3-22 13:37:48 | 只看該作者
7#
發(fā)表于 2025-3-22 20:05:33 | 只看該作者
8#
發(fā)表于 2025-3-22 22:59:10 | 只看該作者
9#
發(fā)表于 2025-3-23 04:55:41 | 只看該作者
Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimizationective optimization problems. These tools are based on the concept of the empirical attainment function (EAF), which describes the probabilistic distribution of the outcomes obtained by a stochastic algorithm in the objective space. In particular, we consider the visualization of attainment surfaces
10#
發(fā)表于 2025-3-23 08:16:15 | 只看該作者
Mixed Models for the Analysis of Optimization Algorithmsork to separate the effects of algorithmic components and instance features included in the analysis. We regard test instances as drawn from a population and we focus our interest not on those single instances but on the whole population. Hence, instances are treated as a .. Overall these experiment
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-25 17:47
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
奉贤区| 桂阳县| 阳城县| 嘉义县| 绥宁县| 石屏县| 朝阳县| 岳池县| 大余县| 宽城| 永昌县| 柳州市| 三门峡市| 全州县| 天津市| 秦安县| 长沙市| 静宁县| 禹州市| 井陉县| 西贡区| 昌乐县| 桦南县| 贡觉县| 聊城市| 卢龙县| 潍坊市| 安康市| 娱乐| 施秉县| 吉林省| 白玉县| 满洲里市| 乐至县| 金乡县| 锦屏县| 南华县| 佛坪县| 桐庐县| 浮梁县| 监利县|