中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共9条，第1-9条

帮助

条数/页：排序方式：
	An enhancement of task scheduling in cloud computing based on imperialist competitive algorithm and firefly algorithm 期刊论文 OAI收割 JOURNAL OF SUPERCOMPUTING, 2020, 卷号: 76, 期号: 8, 页码: 6302-6329 作者: Kashikolaei, Seyedeh Monireh Ggasemnezhad; Hosseinabadi, Ali Asghar Rahmani; Saemi, Behzad; Shareh, Morteza Babazadeh; Sangaiah, Arun Kumar \| 收藏 \| 浏览/下载：29/0 \| 提交时间：2020/08/21 Cloud computing Task scheduling Load balancing Imperialist competitive algorithm Firefly algorithm
	Flood susceptibility mapping in Dingnan County (China) using adaptive neuro-fuzzy inference system with biogeography based optimization and imperialistic competitive algorithm 期刊论文 OAI收割 JOURNAL OF ENVIRONMENTAL MANAGEMENT, 2019, 卷号: 247, 页码: 712-729 作者: Wang, Yi; Hong, Haoyuan; Chen, Wei; Li, Shaojun; Panahi, Mahdi \| 收藏 \| 浏览/下载：19/0 \| 提交时间：2020/04/08 Flood susceptibility mapping Adaptive neuro-fuzzy inference system Metaheuristic methods Biogeography based optimization Imperialistic competitive algorithm
	Incoherent beam combining based on imperialist competitive algorithm 期刊论文 OAI收割 Optik, 2018, 卷号: 168, 页码: 2019-01-09 作者: Song, J. K.; Yang, G. Q.; Li, Y. Y.; Wang, T. F. \| 收藏 \| 浏览/下载：24/0 \| 提交时间：2019/09/17 Incoherent beam combining Imperialist competitive algorithm SPGD algorithm atmospheric propagation lasers array kw Optics
	Randomized oblivious integral routing for minimizing power cost 期刊论文 OAI收割 THEORETICAL COMPUTER SCIENCE, 2015, 卷号: 607, 页码: 221-246 作者: Shi, Yangguang; Zhang, Fa; Wu, Jie; Liu, Zhiyong \| 收藏 \| 浏览/下载：27/0 \| 提交时间：2019/12/13 Oblivious routing Integral routing Randomized algorithm Competitive ratio Energy efficiency
	A novel algorithm for action landmarks extraction (EI CONFERENCE) 会议论文 OAI收割 2012 2nd International Conference on Advanced Materials and Computer Science, ICAMCS 2012, December 27, 2012 - December 28, 2012, Xiamen, China 作者: Zhao J. 收藏 \| 浏览/下载：15/0 \| 提交时间：2013/03/25 In this work we present a new algorithm for extracting action landmarks from proposition landmarks graph. Compared to published approaches the action landmarks extraction algorithm we proposed can find more disjunctive action landmarks and single action landmarks. We illustrate our ideas with experiments among benchmark domains. The experiments show that the new algorithm is competitive with traditional algorithm for finding action landmarks from relaxed plan graph. (2013) Trans Tech Publications Switzerland.
	TextureGrow: Object recognition and segmentation with limit prior knowledge (EI CONFERENCE) 会议论文 OAI收割 2011 International Conference on Network Computing and Information Security, NCIS 2011, May 14, 2011 - May 15, 2011, Guilin, Guangxi, China Yao Z.; Han Q. 收藏 \| 浏览/下载：29/0 \| 提交时间：2013/03/25 In this paper we present a new method for automatically visual recognition and semantic segmentation of photographs. Our automatically and rapidly approach based on Cellular Automation. Most of the analysis and description of recognition and segmentation are based on statistical or structural properties of this attribute most of them need plenty of samples and prior Knowledge. In this paper within a few evident samples (not too many) we can first get the texture feature of each component and the structures then select the approximately location randomly of the objects or patches of them then we use the Cellular Automata algorithm to "grow" based on texture of different objects. The grow progress will stop When texture grow to the boundary. By this steps a new method is found which allow us use very few samples and low lever experience and get a rapidly and accuracy way to recognize and segment objects. We found that this new propose gives competitive results with limited experience and samples. 2011 IEEE.
	A comparative study of discrete differential evolution on binary constraint satisfaction problems (EI CONFERENCE) 会议论文 OAI收割 2008 IEEE Congress on Evolutionary Computation, CEC 2008, June 1, 2008 - June 6, 2008, Hong Kong, China Yang Q. 收藏 \| 浏览/下载：65/0 \| 提交时间：2013/03/25 There are some variants and applications of the discretization of differential evolution. Performances of discrete differential evolution algorithms on random binary constraint satisfaction problem are studied in this paper and a novel discrete differential evolution algorithm based on exchanging elements is proposed. We compare the proposed discrete differential evolution evolutionary algorithms and discrete particle swarm optimization on random binary constraint satisfaction problems. Experimental results indicate though the proposed algorithm is simpler it is competitive with other evolutionary algorithms solving constraint satisfaction problems. 2008 IEEE.
	Multicast routing, load balancing, and wavelength assignment on tree of rings 期刊论文 OAI收割 IEEE COMMUNICATIONS LETTERS, 2002, 卷号: 6, 期号: 2, 页码: 79-81 作者: Jia, XH; Hu, XD; Ruan, L; Sun, JH \| 收藏 \| 浏览/下载：23/0 \| 提交时间：2018/07/30 competitive algorithm multicast routing wavelength assignment
	two online algorithms for the ambulance systems 期刊论文 OAI收割 JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2001, 卷号: 16, 期号: 2, 页码: 176-181 Sui YF \| 收藏 \| 浏览/下载：17/0 \| 提交时间：2011/07/29 online algorithm k-server problem competitive analysis