咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,229 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=Approximation Algorithm"
3229 条 记 录,以下是291-300 订阅
排序:
AN approximation algorithm TO THE SOURCEWISE GREEN'S FUNCTION IN THE D'ALEMBERT EQUATION FOR THE CIRCULAR WAVEGUIDE  10
AN APPROXIMATION ALGORITHM TO THE SOURCEWISE GREEN'S FUNCTIO...
收藏 引用
10th International Conference on Antenna Theory and Techniques (ICATT)
作者: Prijmenko, S. D. Bondarenko, L. A. NSC KIPT Inst Plasma Elect & New Methods Accelerat Kharkov Ukraine
The approximation algorithm to the tensor Green's function calculation in the D'Alembert equation for the polarization potential in the circular waveguide is proposed. The tensor Green's function is presen... 详细信息
来源: 评论
approximation algorithms for the dynamic k-level facility location problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 853卷 43-56页
作者: Wang, Limin Zhang, Zhao Wu, Chenchen Xu, Dachuan Zhang, Xiaoyan Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China Zhejiang Normal Univ Coll Math & Comp Sci Jinhua 321004 Zhejiang Peoples R China Tianjin Univ Technol Coll Sci Tianjin 300384 Peoples R China Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Nanjing Normal Univ Sch Math Sci Nanjing 210023 Jiangsu Peoples R China Nanjing Normal Univ Inst Math Nanjing 210023 Jiangsu Peoples R China
In this paper, we first consider a dynamic k-level facility location problem, which is a generalization of the k-level facility location problem when considering time factor. We present a combinatorial primal-dual app... 详细信息
来源: 评论
approximation algorithms for two clustered arc routing problems
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年 第5期47卷 88-88页
作者: Bao, Xiaoguang Ni, Xinhao Shanghai Ocean Univ Coll Informat Technol Shanghai 201306 Peoples R China
Given a strongly connected mixed graph G=(V,E,A)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{... 详细信息
来源: 评论
approximation algorithms for profit maximisation in multicast D2D networks
收藏 引用
INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2021年 第1期36卷 8-19页
作者: Bhat, Jagadeesha R. Sheu, Jang-Ping Hon, Wing-Kai Yang, Cian-You St Joseph Engn Coll Dept ECE Mangalore India Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan
As the demand for mobile data services increases, telecom companies need to develop wise strategies to retain existing customers. For instance, in a multicast scenario, satisfying individual user's quality of serv... 详细信息
来源: 评论
approximation algorithms for some position-dependent scheduling problems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2021年 289卷 22-31页
作者: Yang, Liya Lu, Xiwen East China Univ Sci & Technol Sch Sci Dept Math Shanghai 200237 Peoples R China
The general position-dependent scheduling problems are studied in this paper. A 2-approximation algorithm is proposed for the learning scheduling problem on a single machine with release time to minimize the makespan.... 详细信息
来源: 评论
Clever Steady Strategy algorithm: A simple and efficient approximation algorithm for minimum vertex cover problem  13
<i>Clever Steady Strategy Algorithm</i>: A simple and effici...
收藏 引用
13th International Conference Frontiers Information Technology (FIT 2015)
作者: Fayaz, Muhammad Arshad, Shakeel Univ Malakand Dept Comp Sci & Informat Technol Kpk Pakistan
This paper presents a simple and fast polynomial time algorithm, the clever, steady strategy algorithm (CSSA). The proposed algorithm consists of three stages which produces optimal or approximate vertex cover for any... 详细信息
来源: 评论
approximation algorithms for fuzzy C-means problem based on seeding method
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 885卷 146-158页
作者: Liu, Qian Liu, Jianxin Li, Min Zhou, Yang Shandong Normal Univ Sch Math & Stat Jinan Peoples R China
As a kind of important soft clustering model, the fuzzy C-means method is widely applied in many fields. In this method, instead of the strict distributive ability in the classical k-means method, all the sample point... 详细信息
来源: 评论
approximation algorithms for Maximally Balanced Connected Graph Partition
收藏 引用
algorithmICA 2021年 第12期83卷 3715-3740页
作者: Chen, Yong Chen, Zhi-Zhong Lin, Guohui Xu, Yao Zhang, An Hangzhou Dianzi Univ Dept Math Hangzhou Peoples R China Tokyo Denki Univ Div Informat Syst Design Saitama Japan Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Georgia So Univ Dept Comp Sci Statesboro GA 30460 USA
Given a connected graph G = (V, E), we seek to partition the vertex set V into k non-empty parts such that the subgraph induced by each part is connected, and the partition is maximally balanced in the way that the ma... 详细信息
来源: 评论
An approximation algorithm for the Two-Stage Distributionally Robust Facility Location Problem  3
An Approximation Algorithm for the Two-Stage Distributionall...
收藏 引用
3rd World Congress of Global Optimization (WCGO)
作者: Wu, Chenchen Du, Donglei Xu, Dachuan Tianjin Univ Technol Coll Sci Tianjin 300384 Peoples R China Beijing Univ Technol Dept Appl Math Beijing 100124 Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB E3B 9Y2 Canada
In this paper, we introduce a model of distributionally robust facility location problem (DRFLP) under moment constraints up to the second order. We show, via duality theory of moment problems, that the linear relaxat... 详细信息
来源: 评论
approximation algorithms for the multiprocessor scheduling with submodular penalties
收藏 引用
OPTIMIZATION LETTERS 2021年 第6期15卷 2165-2180页
作者: Liu, Xiaofei Li, Weidong Peking Univ Sch Elect Engn & Comp Sci Beijing Peoples R China Yunnan Univ Sch Math & Stat Kunming Yunnan Peoples R China
In this paper, we consider multiprocessor scheduling with submodular penalties to extend multiprocessor scheduling with rejection to submodular function. An instance of the problem is given by n jobs and m machines wi... 详细信息
来源: 评论