找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 18084|回复: 47
发表于 2025-3-21 18:56:16 | 显示全部楼层 |阅读模式
书目名称Natural Intelligence for Scheduling, Planning and Packing Problems
编辑Raymond Chiong,Sandeep Dhakal
视频video
概述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

您所在的用户组没有投票权限
发表于 2025-3-21 22:12:01 | 显示全部楼层
发表于 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
发表于 2025-3-22 05:14:31 | 显示全部楼层
发表于 2025-3-22 10:51:28 | 显示全部楼层
发表于 2025-3-22 13:22:45 | 显示全部楼层
发表于 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
发表于 2025-3-22 21:20:25 | 显示全部楼层
发表于 2025-3-23 01:34:11 | 显示全部楼层
发表于 2025-3-23 06:49:19 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 00:46
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表