找回密碼
 To register

QQ登錄

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

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

打印 上一主題 下一主題

Titlebook: Computational Intelligence and Intelligent Systems; 4th International Sy Zhihua Cai,Zhenhua Li,Yong Liu Conference proceedings 2009 Springe

[復(fù)制鏈接]
樓主: GLOAT
31#
發(fā)表于 2025-3-27 00:20:40 | 只看該作者
Registrierte Seniorenkriminalit?t, yields better structures in fewer iterations than initializing with random structures. Hence, the proposed two-stage optimization outperforms a local search procedure based on simulated annealing alone.
32#
發(fā)表于 2025-3-27 01:28:30 | 只看該作者
Omnidirectional Motion Control for the Humanoid Soccer Robota Nao model. This has greatly increased the complexity and difficulty of motion controller for Nao. Based on the analysis of Nao’s structure, our team G-Star has worked out the quantitative relation of joint angle in motion control and developed a toolkit to calculate the angle of joints accurately.
33#
發(fā)表于 2025-3-27 06:39:09 | 只看該作者
Routing Algorithm Based on Gnutella Modelto result in the network congestion and instability. In order to solve this problem, this paper improved the current routing algorithm based on the Ant algorithm. For achieving the optimal routing, the algorithm amended the routing gradually. In the routing search, it also avoided the randomization
34#
發(fā)表于 2025-3-27 09:57:49 | 只看該作者
Sliding-Window Recursive PLS Based Soft Sensing Model and Its Application to the Quality Control of h complex nonlinearity and time-variance, an adaptive soft sensing model based on sliding-widow recursive PLS (RPLS) is presented to build a prediction model for the Mooney-viscosity of rubber mixture. The improved RPLS model can adaptively adjust the structures and parameters of PLS model according
35#
發(fā)表于 2025-3-27 14:22:53 | 只看該作者
The Research of Method Based on Complex Multi-task Parallel Scheduling Problemhot research spots for domestic and foreign experts or scholars. This paper mainly proposes an optimization method of network planning project by using an improved genetic algorithm for solving complex parallel multi-task scheduling problems. It used a method that gradually increases the number of p
36#
發(fā)表于 2025-3-27 18:11:28 | 只看該作者
37#
發(fā)表于 2025-3-27 21:55:02 | 只看該作者
A Cluster-Based Orthogonal Multi-Objective Genetic Algorithmnce the convergence and diversity of a multi-objective genetic algorithm. This paper introduces a new algorithm, with both good convergence and diversity based on clustering method and multi-parent crossover operator. Meanwhile, an initial population is generated by orthogonal design to enhance the
38#
發(fā)表于 2025-3-28 05:41:29 | 只看該作者
39#
發(fā)表于 2025-3-28 06:18:30 | 只看該作者
40#
發(fā)表于 2025-3-28 12:23:00 | 只看該作者
An Multi-objective Evolutionary Algorithm with Lower-Dimensional Crossover and Dense Controlhm that can have a good control of both. The algorithm not only adopts the Lowerdimensional Crossover algorithm to accelerate the convergence but also proposes two good methods to keep the wide population distribution for global search. Also a new method is put forward as an algorithm of repulsing m
 關(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-7 14:27
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
南汇区| 红河县| 广南县| 寿阳县| 岐山县| 葵青区| 泗水县| 西畴县| 平泉县| 苏州市| 荣成市| 台东市| 个旧市| 凤冈县| 静安区| 林周县| 松江区| 新沂市| 长海县| 临澧县| 阿合奇县| 黎川县| 高台县| 介休市| 塔城市| 绥中县| 固镇县| 三台县| 红原县| 玉溪市| 张家川| 武乡县| 岢岚县| 保德县| 通海县| 新昌县| 会同县| 新泰市| 柞水县| 迭部县| 遵义市|