找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Genetic and Evolutionary Computing; Proceedings of the S Jeng-Shyang Pan,Pavel Krömer,Václav Snášel Conference proceedings 2014 Springer In

[复制链接]
楼主: Optician
发表于 2025-4-1 03:25:53 | 显示全部楼层
发表于 2025-4-1 08:23:27 | 显示全部楼层
Demoskopie: Rolle und Wirkungsweise,s. Task scheduling is a critical issue for grid computing, which maps tasks onto a parallel and distributed system for achieving good performance in terms of minimizing the overall execution time. This paper presents a genetic algorithm to solve this problem for improving the existing genetic algori
发表于 2025-4-1 13:07:00 | 显示全部楼层
A Conceptual Model of Desire-Based Choicelve these problems approximately, when solving them exactly is impractical. In this class of methods, swarm intelligence (SI) presents metaheuristics that exploit a population of interacting agents able to self–organize, such as ant colony optimization (ACO), particle swarm optimization (PSO), and a
发表于 2025-4-1 14:37:44 | 显示全部楼层
https://doi.org/10.1007/978-3-322-95759-7everal clustering algorithms have been proposed in the literature, and they are used in several areas: security, marketing, documentation, social networks etc. The K-means algorithm is one of the best clustering algorithms. It is very efficient but its performance is very sensitive to the initializa
发表于 2025-4-1 18:56:51 | 显示全部楼层
发表于 2025-4-2 00:33:47 | 显示全部楼层
https://doi.org/10.1007/978-3-663-09579-8res from images and it is a useful tool for matching between different views of an object. This paper proposes how the SIFT can be used for an object detection problem, especially human detection problem. The Support Vector Machine (SVM) is adopted as the classifier in the proposed scheme. Experimen
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 02:21
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表