找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Natural Intelligence for Scheduling, Planning and Packing Problems; Raymond Chiong,Sandeep Dhakal Book 2009 Springer-Verlag Berlin Heidelb

[復制鏈接]
查看: 18181|回復: 47
樓主
發(fā)表于 2025-3-21 18:56:16 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems
編輯Raymond Chiong,Sandeep Dhakal
視頻videohttp://file.papertrans.cn/662/661771/661771.mp4
概述Recent research in Natural Intelligence for Scheduling, Planning and Packing Problems
叢書名稱Studies in Computational Intelligence
圖書封面Titlebook: Natural Intelligence for Scheduling, Planning and Packing Problems;  Raymond Chiong,Sandeep Dhakal Book 2009 Springer-Verlag Berlin Heidelb
描述.Scheduling, planning and packing are ubiquitous problems that can be found in a wide range of real-world settings. These problems transpire in a large variety of forms, and have enormous socio-economic impact. For many years, significant work has been devoted to automating the processes of scheduling, planning and packing using different kinds of methods. However, poor scaling and the lack of flexibility of many of the conventional methods coupled with the fact that most of the real-world problems across the application areas of scheduling, planning and packing nowadays tend to be of large scale, dynamic and full of complex dependencies have made it necessary to tackle them in unconventional ways....This volume, "Natural Intelligence for Scheduling, Planning and Packing Problems", is a collection of numerous natural intelligence based approaches for solving various kinds of scheduling, planning and packing problems. It comprises 12 chapters which present many methods that draw inspiration from nature, such as evolutionary algorithms, neural-fuzzy system, particle swarm algorithms, ant colony optimisation, extremal optimisation, raindrop optimisation, and so on. Problems addressed
出版日期Book 2009
關鍵詞algorithms; distribution; evolution; evolutionary algorithm; fuzzy system; genetic algorithm; genetic algo
版次1
doihttps://doi.org/10.1007/978-3-642-04039-9
isbn_softcover978-3-642-26061-2
isbn_ebook978-3-642-04039-9Series ISSN 1860-949X Series E-ISSN 1860-9503
issn_series 1860-949X
copyrightSpringer-Verlag Berlin Heidelberg 2009
The information of publication is updating

書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems影響因子(影響力)




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems影響因子(影響力)學科排名




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems網絡公開度




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems網絡公開度學科排名




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems被引頻次




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems被引頻次學科排名




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems年度引用




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems年度引用學科排名




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems讀者反饋




書目名稱Natural Intelligence for Scheduling, Planning and Packing Problems讀者反饋學科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 22:12:01 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:33:37 | 只看該作者
Maksud Ibrahimov,Arvind Mohais,Zbigniew Michalewiczls of publishers or subscribers by only forwarding messages via connections which satisfy the desired security levels. For example, a client publishing a message over a secured channel can instruct the broker to forward the message exclusively to subscribers that are securely connected. We prototypi
地板
發(fā)表于 2025-3-22 05:14:31 | 只看該作者
5#
發(fā)表于 2025-3-22 10:51:28 | 只看該作者
6#
發(fā)表于 2025-3-22 13:22:45 | 只看該作者
7#
發(fā)表于 2025-3-22 18:38:21 | 只看該作者
Tom Lenaerts,Anne Defaweux party following the last one. This design makes our protocol to be highly scalable due to the independence of each party’s complexity from the number of participating parties and thus causes a communication and computation complexities of ., where . is the set size, . is the number of hash function
8#
發(fā)表于 2025-3-22 21:20:25 | 只看該作者
9#
發(fā)表于 2025-3-23 01:34:11 | 只看該作者
10#
發(fā)表于 2025-3-23 06:49:19 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-6 21:47
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
吉木萨尔县| 宁国市| 孝感市| 白银市| 建宁县| 云和县| 海门市| 利津县| 娄底市| 乐陵市| 怀来县| 青海省| 苏尼特左旗| 新干县| 岳西县| 彭山县| 林甸县| 兰坪| 高州市| 巴林左旗| 营山县| 吉安市| 晋中市| 揭西县| 五寨县| 札达县| 渑池县| 阿瓦提县| 夏邑县| 米脂县| 定结县| 晋州市| 甘孜| 银川市| 竹山县| 屯门区| 马山县| 涪陵区| 阿荣旗| 漳浦县| 大竹县|