咨询与建议

限定检索结果

文献类型

  • 22,933 篇 会议
  • 9,215 篇 期刊文献
  • 50 篇 学位论文

馆藏范围

  • 32,198 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 16,122 篇 工学
    • 10,191 篇 计算机科学与技术...
    • 4,918 篇 电气工程
    • 3,183 篇 软件工程
    • 2,703 篇 信息与通信工程
    • 1,962 篇 控制科学与工程
    • 741 篇 机械工程
    • 684 篇 电子科学与技术(可...
    • 606 篇 航空宇航科学与技...
    • 539 篇 仪器科学与技术
    • 233 篇 交通运输工程
    • 214 篇 材料科学与工程(可...
    • 197 篇 化学工程与技术
    • 171 篇 生物工程
    • 158 篇 测绘科学与技术
    • 140 篇 土木工程
    • 135 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,500 篇 理学
    • 9,428 篇 数学
    • 880 篇 物理学
    • 770 篇 系统科学
    • 747 篇 统计学(可授理学、...
    • 267 篇 生物学
    • 239 篇 化学
    • 127 篇 地球物理学
  • 2,504 篇 管理学
    • 1,935 篇 管理科学与工程(可...
    • 678 篇 工商管理
    • 563 篇 图书情报与档案管...
  • 420 篇 经济学
    • 389 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 182 篇 法学
    • 169 篇 社会学
  • 129 篇 文学
  • 129 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,198 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,374 篇 optimization
  • 2,306 篇 approximation me...
  • 2,190 篇 heuristic algori...
  • 1,429 篇 linear programmi...
  • 1,422 篇 convergence
  • 1,293 篇 computational mo...
  • 1,227 篇 resource managem...
  • 1,146 篇 signal processin...
  • 955 篇 computer science
  • 921 篇 polynomials
  • 919 篇 clustering algor...
  • 916 篇 complexity theor...
  • 788 篇 mathematical mod...
  • 754 篇 vectors
  • 711 篇 programming
  • 658 篇 estimation
  • 633 篇 training
  • 614 篇 transportation

机构

  • 97 篇 univ maryland de...
  • 68 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 48 篇 cornell univ dep...
  • 44 篇 tsinghua univers...
  • 39 篇 carnegie mellon ...
  • 38 篇 national institu...
  • 38 篇 iit dept comp sc...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 32 篇 sichuan univ col...
  • 31 篇 school of comput...
  • 31 篇 nanjing univ sta...
  • 29 篇 univ chinese aca...
  • 29 篇 technion haifa
  • 29 篇 princeton univ p...
  • 29 篇 suny stony brook...
  • 28 篇 epfl
  • 28 篇 hong kong polyte...
  • 28 篇 tel aviv univers...

作者

  • 65 篇 woodruff david p...
  • 63 篇 ravi r.
  • 52 篇 kortsarz guy
  • 45 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 40 篇 kumar amit
  • 37 篇 chen zhi-zhong
  • 36 篇 friggstad zachar...
  • 33 篇 kawarabayashi ke...
  • 32 篇 manurangsi pasin
  • 32 篇 chalermsook pari...
  • 31 篇 wang lusheng
  • 30 篇 gudmundsson joac...
  • 29 篇 thai my t.
  • 29 篇 williamson david...
  • 29 篇 carmi paz
  • 28 篇 saha barna
  • 28 篇 dinitz michael
  • 27 篇 shmoys david b.

语言

  • 30,777 篇 英文
  • 1,287 篇 其他
  • 117 篇 中文
  • 9 篇 日文
  • 6 篇 俄文
  • 3 篇 法文
  • 2 篇 西班牙文
  • 1 篇 土耳其文
  • 1 篇 乌克兰文
检索条件"主题词=APPROXIMATION algorithms"
32198 条 记 录,以下是61-70 订阅
排序:
Efficient approximation algorithms for scheduling moldable tasks
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年 第1期310卷 71-83页
作者: Wu, Xiaohu Loiseau, Patrick Beijing Univ Posts & Telecommun Beijing Peoples R China Inria FairPlay Team Palaiseau France
Moldable tasks allow schedulers to determine the number of processors assigned to each task, thus enabling efficient use of large-scale parallel processing systems. We consider the problem of scheduling independent mo... 详细信息
来源: 评论
Outer approximation algorithms for convex vector optimization problems
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 2023年 第4期38卷 723-755页
作者: Keskin, Irem Nur Ulus, Firdevs Duke Univ Fuqua Sch Business Durham NC USA Bilkent Univ Dept Ind Engn Ankara Turkiye Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkiye Bilkent Univ Dept Ind Engn Ankara Turkiye
In this study, we present a general framework of outer approximation algorithms to solve convex vector optimization problems, in which the Pascoletti-Serafini (PS) scalarization is solved iteratively. This scalarizati... 详细信息
来源: 评论
Tight approximation algorithms for Geometric Bin Packing with Skewed Items
收藏 引用
ALGORITHMICA 2023年 第9期85卷 2735-2778页
作者: Khan, Arindam Sharma, Eklavya Indian Inst Sci Bangalore India Univ Illinois Champaign IL 61820 USA
In Two-dimensional Bin Packing (2BP), we are given n rectangles as input and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square bins. 2BP admits no AP... 详细信息
来源: 评论
approximation algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles  63
Approximation Algorithms and Hardness for n-Pairs Shortest P...
收藏 引用
63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)
作者: Dalirrooyfard, Mina Jin, Ce Williams, Virginia Vassilevska Wein, Nicole MIT EECS 77 Massachusetts Ave Cambridge MA 02139 USA MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA Rutgers State Univ DIMACS New Brunswick NJ USA
We study the approximability of two related problems on graphs with n nodes and m edges: n-Pairs Shortest Paths (n-PSP), where the goal is to find a shortest path between O(n) prespecified pairs, and All Node Shortest... 详细信息
来源: 评论
approximation algorithms for the Generalized Team Orienteering Problem and its Applications
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2021年 第1期29卷 176-189页
作者: Xu, Wenzheng Liang, Weifa Xu, Zichuan Peng, Jian Peng, Dezhong Liu, Tang Jia, Xiaohua Das, Sajal K. Sichuan Univ Coll Comp Sci Chengdu 610065 Peoples R China Australian Natl Univ Res Sch Comp Sci Canberra ACT 2601 Australia Dalian Univ Technol Sch Software Dalian 116024 Peoples R China Peng Cheng Lab Shenzhen 518052 Peoples R China Sichuan Normal Univ Coll Comp Sci Chengdu 610068 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA
In this article we study a generalized team orienteering problem (GTOP), which is to find service paths for multiple homogeneous vehicles in a network such that the profit sum of serving the nodes in the paths is maxi... 详细信息
来源: 评论
approximation algorithms for sorting permutations by extreme block-interchanges
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 891卷 105-115页
作者: Pai, Jayakumar Chitturi, Bhadrachalam Amrita Vishwa Vidyapeetham Dept Comp Sci & Applicat Amritapuri India Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA
Sorting permutations with various operations has applications in macro rearrangement of genes in a genome and the design of computer interconnection networks. Block-interchange is a powerful operation that swaps two s... 详细信息
来源: 评论
approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2021年 第15期59卷 4579-4592页
作者: Wang, Shijin Cui, Wenli Tongji Univ Sch Econ & Management Shanghai Peoples R China
We consider the robust (min-max regret) version of identical parallel machine scheduling problem, in which jobs may be outsourced to balance total cost against production efficiency. The total cost is measured in term... 详细信息
来源: 评论
approximation algorithms on k-Cycle Transversal and k-Clique Transversal
收藏 引用
Journal of the Operations Research Society of China 2021年 第4期9卷 883-892页
作者: Zhong-Zheng Tang Zhuo Diao School of Science Beijing University of Posts and TelecommunicationsBeijing 100876China School of Statistics and Mathematics Central University of Finance and EconomicsBeijing 100081China
Given a weighted graph G=(V,E)with weight w:E→Z+,a k-cycle transversal is an edge subset A of E such that G−A has no *** minimum weight of kcycle transversal is the weighted transversal number on k-cycle,denoted byτ... 详细信息
来源: 评论
approximation algorithms for Scheduling and Fair Allocations
Approximation Algorithms for Scheduling and Fair Allocations
收藏 引用
作者: Zhang, Yihao University of Washington
学位级别:Ph.D., Doctor of Philosophy
In this thesis, we will have discussions on two main topics, max-min allocation and scheduling jobs with precedent constraints on machines with communication delays. New approximation algorithms are given in Chapter 2... 详细信息
来源: 评论
approximation algorithms for Maximum Matchings in Geometric Intersection Graphs  38
Approximation Algorithms for Maximum Matchings in Geometric ...
收藏 引用
38th International Symposium on Computational Geometry, SoCG 2022
作者: Har-Peled, Sariel Yang, Everett Department of Computer Science University of Illinois 201 N. Goodwin Avenue UrbanaIL61801 United States
We present a (1-e)-approximation algorithms for maximum cardinality matchings in disk intersection graphs - all with near linear running time. We also present an estimation algorithm that returns (1 ± e)-approxim... 详细信息
来源: 评论