咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 19 篇 工学
    • 15 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 3 篇 信息与通信工程
    • 2 篇 食品科学与工程(可...
    • 1 篇 机械工程
    • 1 篇 控制科学与工程
    • 1 篇 软件工程
  • 13 篇 理学
    • 12 篇 数学
    • 1 篇 生物学
    • 1 篇 统计学(可授理学、...
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 25 篇 competitive algo...
  • 6 篇 group testing
  • 2 篇 graph testing
  • 2 篇 total unduplicat...
  • 2 篇 hypergraph
  • 2 篇 large datasets
  • 2 篇 on-line problem
  • 2 篇 cbr
  • 2 篇 multi-cbr agent
  • 2 篇 market research
  • 2 篇 product optimiza...
  • 1 篇 on-line explorat...
  • 1 篇 data caching
  • 1 篇 self-adaptive di...
  • 1 篇 team formation
  • 1 篇 bounds
  • 1 篇 benchmark functi...
  • 1 篇 large scale glob...
  • 1 篇 motion planning
  • 1 篇 competitive algo...

机构

  • 2 篇 zhejiang gongsha...
  • 1 篇 cent univ nation...
  • 1 篇 kyushu sangyo un...
  • 1 篇 univ minnesota d...
  • 1 篇 tongji univ sch ...
  • 1 篇 natl chiao tung ...
  • 1 篇 zhejiang gongsha...
  • 1 篇 hebei univ fac m...
  • 1 篇 univ ioannina gr...
  • 1 篇 univ pompeu fabr...
  • 1 篇 chongqing univ p...
  • 1 篇 university of ma...
  • 1 篇 chinese acad sci...
  • 1 篇 univ hong kong d...
  • 1 篇 chinese acad sci...
  • 1 篇 univ quebec outa...
  • 1 篇 huazhong univ sc...
  • 1 篇 city univ hong k...
  • 1 篇 chinese acad med...
  • 1 篇 donghua univ glo...

作者

  • 3 篇 chen ting
  • 2 篇 du dz
  • 1 篇 sun sz
  • 1 篇 jin ting
  • 1 篇 ennis john m.
  • 1 篇 li dashuang
  • 1 篇 wang baoxi
  • 1 篇 brest janez
  • 1 篇 xu yf
  • 1 篇 wang xz
  • 1 篇 tan wenan
  • 1 篇 hu xd
  • 1 篇 孙钟秀
  • 1 篇 triesch eberhard
  • 1 篇 liu ming
  • 1 篇 bose prosenjit
  • 1 篇 gao guichen
  • 1 篇 li y
  • 1 篇 czyzowicz jurek
  • 1 篇 durocher stephan...

语言

  • 21 篇 英文
  • 4 篇 其他
检索条件"主题词=competitive algorithm"
25 条 记 录,以下是1-10 订阅
排序:
Team Formation in Social Networks Using Imperialist competitive algorithm  4th
Team Formation in Social Networks Using Imperialist Competit...
收藏 引用
4th International Conference on Cloud Computing and Security (ICCCS)
作者: Tan, Wenan Jin, Ting Nanjing Univ Aeronaut & Astronaut Nanjing Jiangsu Peoples R China Shanghai Polytech Univ Shanghai Peoples R China
With the prevalence of various social sites and the rapid development of Internet communication, the problem of team formation in social networks has aroused the enthusiasm of many scholars. Previous research concentr... 详细信息
来源: 评论
More efficient algorithms for searching for several edges in a hypergraph
收藏 引用
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS 2024年 1-9页
作者: Chen, Ting Zhejiang Gongshang Univ Sch Stat & Math Hangzhou Peoples R China
The edge searching problem is a generalization of the classical group testing problem. Chen and Hwang studied the problem of searching for many edges in a hypergraph with rank r. They provided a competitive algorithm ... 详细信息
来源: 评论
Two-sided assembly line balancing with operator number and task constraints: a hybrid imperialist competitive algorithm
收藏 引用
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2014年 第5-8期74卷 791-805页
作者: Wang, Baoxi Guan, Zailin Li, Dashuang Zhang, Chaoyong Chen, Lei Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol HUST SANY Joint Lab Adv Mfg Wuhan 430074 Peoples R China
Two-sided assembly line balancing problems usually occur in plants producing large-sized high-volume products such as buses, trucks, or cars. Comparing to traditional simple assembly lines, the two-sided assembly line... 详细信息
来源: 评论
Upper and lower bounds for competitive group testing
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期333卷 136-150页
作者: Scheidweiler, Robert Triesch, Eberhard Rhein Westfal TH Aachen Lehrstuhl Math 2 Aachen Germany
We consider competitive algorithms for adaptive group testing problems. In the first part of the paper, we develop an algorithm with competitive constant c < 1.452 thus improving the up to now best known algorithms... 详细信息
来源: 评论
Online data caching in edge computing
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2023年 第17期35卷
作者: Han, Xinxin Gao, Guichen Wang, Yang Ting, Hing-Fung You, Ilsun Zhang, Yong Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Chinese Acad Sci Univ Chinese Acad Sci Beijing Peoples R China Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Soonchunhyang Univ Dept Informat Secur Engn Soonchunhyang South Korea
Data caching is an effective method to reduce traffic and improve the quality of service in network. Traditionally, users' requests are offloaded to the cloud for centralized computing. However, due to security an... 详细信息
来源: 评论
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2013年 第4期26卷 687-708页
作者: Asahiro, Yuichi Kanmera, Kenta Miyano, Eiji Kyushu Sangyo Univ Dept Informat Sci Higashi Ku Fukuoka 8138503 Japan Kyushu Inst Technol Dept Syst Design & Informat Iizuka Fukuoka 8208502 Japan
This paper studies the online Orthogonal Variable Spreading Factor (OVSF) code assignment problem with resource augmentation introduced by Erlebach et al. (in STACS 2004. LNCS, vol. 2996, pp. 270-281, 2004). We propos... 详细信息
来源: 评论
eTURF: A competitive TURF algorithm for large datasets
收藏 引用
FOOD QUALITY AND PREFERENCE 2012年 第1期23卷 44-48页
作者: Ennis, John M. Fayle, Charles M. Ennis, Daniel M. Inst Percept Richmond VA 23235 USA
Although Total Unduplicated Reach and Frequency (TURF) analysis has repeatedly demonstrated value in a variety of market research applications, TURF analyses on large problem sizes have historically either been unacce... 详细信息
来源: 评论
competitive Online Routing on Delaunay Triangulations
收藏 引用
International Journal of Computational Geometry and Applications 2017年 第4期27卷 241-253页
作者: Bose, Prosenjit De Carufel, Jean-Lou Durocher, Stephane Taslakian, Perouz Carleton University Ottawa Canada University of Manitoba Winnipeg Canada American University of Armenia Yerevan Armenia
Let G be a graph, ψ G be a source node and ψ G be a target node. The sequence of adjacent nodes (graph walk) visited by a routing algorithm is a c-competitive route if its length in G is at most c times the length o... 详细信息
来源: 评论
An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals  9th
An Online Model of Berth and Quay Crane Integrated Allocatio...
收藏 引用
9th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Zheng, Feifeng Qiao, Longliang Liu, Ming Donghua Univ Glorious Sun Sch Business & Management Shanghai 200051 Peoples R China Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China
Due to the frequent arrivals of real-time vessels beyond those being well planned in many container terminals, this paper studies an online over-list model of integrated allocation of berths and quay cranes in a conta... 详细信息
来源: 评论
competitive Agglomeration Based KNN in indoor WLAN Localization Environment  10
Competitive Agglomeration Based KNN in indoor WLAN Localizat...
收藏 引用
10th International Conference on Communications and Networking in China (CHINACOM)
作者: Jiang, Qing Li, Kunpeng Zhou, Mu Tian, Zengshan Xiang, Ming Chongqing Univ Posts & Telecommun Chongqing Key Lab Mobile Commun Technol Chongqing Peoples R China
In this paper, we proposed a novel localization algorithm in indoor Wireless Local Area Network (WLAN) environment. First of all, to conduct the Received Signal Strength (RSS) preprocessing, we eliminate the RSS outli... 详细信息
来源: 评论