咨询与建议

限定检索结果

文献类型

  • 18 篇 期刊文献
  • 11 篇 会议

馆藏范围

  • 29 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 26 篇 工学
    • 24 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 2 篇 机械工程
    • 2 篇 信息与通信工程
    • 1 篇 动力工程及工程热...
    • 1 篇 控制科学与工程
    • 1 篇 石油与天然气工程
  • 10 篇 管理学
    • 10 篇 管理科学与工程(可...
  • 6 篇 理学
    • 5 篇 数学
    • 1 篇 生物学

主题

  • 29 篇 algorithm portfo...
  • 4 篇 algorithm select...
  • 4 篇 machine learning
  • 3 篇 performance pred...
  • 2 篇 parallel distrib...
  • 2 篇 las vegas algori...
  • 2 篇 evolutionary alg...
  • 2 篇 maximum coverage...
  • 2 篇 racing algorithm
  • 2 篇 combinatorial op...
  • 2 篇 algorithm select...
  • 2 篇 software verific...
  • 2 篇 restart
  • 2 篇 software metrics
  • 2 篇 resource provisi...
  • 2 篇 parallel optimiz...
  • 1 篇 flynn's taxonomy
  • 1 篇 online model sel...
  • 1 篇 experimentation
  • 1 篇 project scheduli...

机构

  • 2 篇 tianjin normal u...
  • 2 篇 indian inst tech...
  • 2 篇 univ pittsburgh ...
  • 2 篇 city univ hong k...
  • 2 篇 tu wien karlspl ...
  • 1 篇 univ michoacana ...
  • 1 篇 qarnot comp dept...
  • 1 篇 ikerbasque basqu...
  • 1 篇 univ paris 13
  • 1 篇 indian inst tech...
  • 1 篇 southern univ sc...
  • 1 篇 southern univ sc...
  • 1 篇 florida inst tec...
  • 1 篇 univ grenoble al...
  • 1 篇 basque fdn sci i...
  • 1 篇 univ sheffield d...
  • 1 篇 univ grenoble al...
  • 1 篇 univ deusto deus...
  • 1 篇 univ manchester ...
  • 1 篇 albert ludwigs u...

作者

  • 5 篇 ngoko yanik
  • 4 篇 trystram denis
  • 3 篇 cerin christophe
  • 2 篇 pani thomas
  • 2 篇 yao xin
  • 2 篇 prokopyev oleg a...
  • 2 篇 lou yang
  • 2 篇 tiwari m. k.
  • 2 篇 zuleger florian
  • 2 篇 goldman alfredo
  • 2 篇 yuen shiu yin
  • 2 篇 mauro jacopo
  • 2 篇 amadini roberto
  • 2 篇 masegosa antonio...
  • 2 篇 demyanova yulia
  • 2 篇 zhang xin
  • 2 篇 veith helmut
  • 2 篇 pelta david a.
  • 2 篇 tong hao
  • 2 篇 gabbrielli mauri...

语言

  • 29 篇 英文
检索条件"主题词=Algorithm Portfolio"
29 条 记 录,以下是1-10 订阅
排序:
algorithm portfolio based scheme for dynamic optimization problems
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2015年 第4期8卷 667-689页
作者: Fajardo Calderin, Jenny Masegosa, Antonio D. Pelta, David A. Polytech Higher Inst Jose A Echeverria Dept Artificial Intelligence & Infrastruct & Syst Havana Cuba Univ Deusto Deusto Inst Technol Bilbao Spain Basque Fdn Sci Ikerbasque Bilbao Spain Univ Granada Dept Comp Sci & AI Res Ctr ICT CITIC UGR Granada Spain
Since their first appearance in 1997 in the prestigious journal Science, algorithm portfolios have become a popular approach to solve static problems. Nevertheless and despite that success, they have not received much... 详细信息
来源: 评论
algorithm portfolio for Parameter Tuned Evolutionary algorithms
Algorithm Portfolio for Parameter Tuned Evolutionary Algorit...
收藏 引用
IEEE Symposium Series on Computational Intelligence (SSCI)
作者: Tong, Hao Zhang, Shuyi Huang, Changwu Yao, Xin Southern Univ Sci & Technol Dept Comp Sci & Engn Univ Key Lab Evolving Intelligent Syst Guangdong Shenzhen 518055 Peoples R China
Evolutionary algorithms' performance can be enhanced significantly by using suitable parameter configurations when solving optimization problems. Most existing parametertuning methods are inefficient, which tune a... 详细信息
来源: 评论
algorithm portfolio for Individual-based Surrogate-Assisted Evolutionary algorithms
Algorithm Portfolio for Individual-based Surrogate-Assisted ...
收藏 引用
Genetic and Evolutionary Computation Conference (GECCO)
作者: Tong, Hao Liu, Jialin Yao, Xin Southern Univ Sci & Technol Dept Comp Sci & Engn Univ Key Lab Evolving Intelligent Syst Guangdong Shenzhen Key Lab Computat Intelligence Shenzhen Peoples R China
Surrogate-assisted evolutionary algorithms (SAEAs) are powerful optimisation tools for computationally expensive problems (CEPs). However, a randomly selected algorithm may fail in solving unknown problems due to no f... 详细信息
来源: 评论
Which algorithm should I choose: An evolutionary algorithm portfolio approach
收藏 引用
APPLIED SOFT COMPUTING 2016年 40卷 654-673页
作者: Yuen, Shiu Yin Chow, Chi Kin Zhang, Xin Lou, Yang City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China Tianjin Normal Univ Coll Elect & Commun Engn Tianjin Peoples R China
Many good evolutionary algorithms have been proposed in the past. However, frequently, the question arises that given a problem, one is at a loss of which algorithm to choose. In this paper, we propose a novel algorit... 详细信息
来源: 评论
An algorithm portfolio for the dynamic maximal covering location problem
收藏 引用
MEMETIC COMPUTING 2017年 第2期9卷 141-151页
作者: Calderin, Jenny Fajardo Masegosa, Antonio D. Pelta, David A. Polytech Higher Inst Jose A Echeverria Dept Articial Intelligence & Infrastruct & Syst Havana Cuba Univ Deusto Fac Engn Bilbao 48007 Spain Deusto Fdn DeustoTech Fdn Deusto Bilbao 48007 Spain Ikerbasque Basque Fdn Sci E-48011 Bilbao Spain Univ Granada Dept Comp Sci & AI Granada Spain
The location of facilities (antennas, ambulances, police patrols, etc) has been widely studied in the literature. The maximal covering location problem aims at locating the facilities in such positions that maximizes ... 详细信息
来源: 评论
A sequential algorithm portfolio approach for black box optimization
收藏 引用
SWARM AND EVOLUTIONARY COMPUTATION 2019年 44卷 559-570页
作者: He, Yaodong Yuen, Shiu Yin Lou, Yang Zhang, Xin City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Tianjin Normal Univ Coll Elect & Commun Engn Tianjin Peoples R China
A large number of optimization algorithms have been proposed. However, the no free lunch (NFL) theorems inform us that no algorithm can solve all types of optimization problems. An approach, which can suggest the most... 详细信息
来源: 评论
An algorithm portfolio based solution methodology to solve a supply chain optimization problem
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2009年 第4期36卷 8407-8420页
作者: Yadav, Salik R. Muddada, Raja Ram M. R. Tiwari, M. K. Shankar, Ravi Indian Inst Technol Dept Ind Engn & Management Kharagpur 721302 W Bengal India Missouri Univ Sci & Technol Dept Engn Management & Syst Engn Rolla MO 65409 USA Indian Inst Technol Dept Management Studies New Delhi 110016 India
This paper introduces the algorithm portfolio concept to solve a combinatorial optimization problem pertaining to a supply chain. The Supply chain problem is modeled with capacity constraints and demand variations ove... 详细信息
来源: 评论
An algorithm portfolio approach to reconfigurable set-up planning
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING 2011年 第8期24卷 756-768页
作者: Prasoon, Ruchir Das, Devashish Tiwari, Manoj Kumar Wang, Lihui Indian Inst Technol Dept Ind Engn Kharagpur 721302 W Bengal India Indian Inst Technol Dept Mech Engn Kharagpur 721302 W Bengal India Univ Skovde Virtual Syst Res Ctr Skovde Sweden Univ Skovde Ctr Intelligent Automat Skovde Sweden
This article discusses an algorithm portfolio approach to find optimal set-up plans in a dynamic shop floor environment where flexibility and promptness of the decision process is critical along with best possible uti... 详细信息
来源: 评论
algorithm portfolios for logistics optimization considering stochastic demands and mobility allowance
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2013年 第1期141卷 146-166页
作者: Shukla, Nagesh Choudhary, A. K. Prakash, P. K. S. Fernandes, K. J. Tiwari, M. K. Univ Sheffield Logist & Supply Chain Res Ctr Sch Management Sheffield S10 2TN S Yorkshire England Univ Wollongong SMART Infrastruct Facil Wollongong NSW 2522 Australia Univ Warwick Digital Lab WMG Coventry CV4 7AL W Midlands England NUI Irish Ctr Mfg Res Maynooth Kildare Ireland Univ York York Management Sch York YO10 5DD N Yorkshire England Indian Inst Technol Dept Ind Engn & Management Kharagpur 721302 W Bengal India
The vehicle routing problem with stochastic demand (VRPSD) is a well known NP-hard problem. The uncharacteristic behaviour associated with the problem enhances the computational efforts required to obtain a feasible a... 详细信息
来源: 评论
On algorithm portfolios and restart strategies
收藏 引用
OPERATIONS RESEARCH LETTERS 2011年 第1期39卷 49-52页
作者: Shylo, Oleg V. Prokopyev, Oleg A. Rajgopal, Jayant Univ Pittsburgh Dept Ind Engn Pittsburgh PA 15261 USA
We consider two parallel strategies for randomized restart algorithms. Given a set of available algorithms, one can either choose the best performing algorithm and run multiple copies of it in parallel (single algorit... 详细信息
来源: 评论