找回密碼
 To register

QQ登錄

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

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

打印 上一主題 下一主題

Titlebook: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur; International Worksh Thomas Stützle,M

[復(fù)制鏈接]
查看: 48259|回復(fù): 54
樓主
發(fā)表于 2025-3-21 17:57:12 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur
副標(biāo)題International Worksh
編輯Thomas Stützle,Mauro Birattari,Holger H. Hoos
視頻videohttp://file.papertrans.cn/311/310968/310968.mp4
叢書(shū)名稱Lecture Notes in Computer Science
圖書(shū)封面Titlebook: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur; International Worksh Thomas Stützle,M
描述Stochastic local search (SLS) algorithms are established tools for the solution of computationally hard problems arising in computer science, business adm- istration, engineering, biology, and various other disciplines. To a large extent, their success is due to their conceptual simplicity, broad applicability and high performance for many important problems studied in academia and enco- tered in real-world applications. SLS methods include a wide spectrum of te- niques, ranging from constructive search procedures and iterative improvement algorithms to more complex SLS methods, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search, and variable neighborhood search. Historically, the development of e?ective SLS algorithms has been guided to a large extent by experience and intuition. In recent years, it has become - creasingly evident that success with SLS algorithms depends not merely on the adoption and e?cient implementation of the most appropriate SLS technique for a given problem, but also on the mastery of a more complex algorithm - gineering process. Challenges in SLS algorithm development arise
出版日期Conference proceedings 2009
關(guān)鍵詞Scheduling; algorithm performance; algorithms; ant colony; autonomous systems; combinatorial optimization
版次1
doihttps://doi.org/10.1007/978-3-642-03751-1
isbn_softcover978-3-642-03750-4
isbn_ebook978-3-642-03751-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2009
The information of publication is updating

書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur影響因子(影響力)




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur影響因子(影響力)學(xué)科排名




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur被引頻次




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur被引頻次學(xué)科排名




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur年度引用




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur年度引用學(xué)科排名




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur讀者反饋




書(shū)目名稱Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heur讀者反饋學(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 22:03:26 | 只看該作者
https://doi.org/10.1007/978-981-19-7485-4mization. We further explore run time distributions and describe a new tool to compare two algorithms based on stochastic local search. For the case where the running times of both algorithms fit exponential distributions, we derive a closed form index that gives the probability that one of them fin
板凳
發(fā)表于 2025-3-22 02:01:05 | 只看該作者
地板
發(fā)表于 2025-3-22 05:35:55 | 只看該作者
5#
發(fā)表于 2025-3-22 11:40:07 | 只看該作者
6#
發(fā)表于 2025-3-22 14:18:36 | 只看該作者
7#
發(fā)表于 2025-3-22 19:22:38 | 只看該作者
nt to grasp the relevant features. In this paper we present and discuss a set of techniques for the visualization of search landscapes aimed at supporting the researcher’s intuition on the behavior of a Stochastic Local Search algorithm applied to a combinatorial optimization problem..We discuss sca
8#
發(fā)表于 2025-3-22 23:52:50 | 只看該作者
9#
發(fā)表于 2025-3-23 03:12:40 | 只看該作者
The Energetics of Mangrove Forestsques are applied to analyse the performance of two different metaheuristics for the team orienteering problem. Furthermore, the parameter setting problem is discussed and the parameter “sensitivity” is analysed.
10#
發(fā)表于 2025-3-23 07:28:56 | 只看該作者
Building an Urban Energy Center,ion performed. A formalization in this sense is proposed here: A method for studying this aspect regardless the type of approach used is defined and tested. The consequent measure of exploration is applied to MAX–MIN Ant System: The impact of the values of the parameters on the exploration is assess
 關(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-6 01:52
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
黄平县| 县级市| 璧山县| 措美县| 兴海县| 六枝特区| 静乐县| 钟祥市| 台南市| 塔河县| 宁武县| 龙南县| 藁城市| 德江县| 鄂托克旗| 济阳县| 平乐县| 奉贤区| 商河县| 博罗县| 夹江县| 日土县| 景宁| 扶风县| 呼玛县| 长沙县| 扶绥县| 六枝特区| 久治县| 海伦市| 三都| 景东| 大安市| 中江县| 淅川县| 邹平县| 曲阜市| 浪卡子县| 乌苏市| 原平市| 内丘县|