咨询与建议

限定检索结果

文献类型

  • 22,901 篇 会议
  • 9,199 篇 期刊文献
  • 50 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 16,125 篇 工学
    • 10,124 篇 计算机科学与技术...
    • 4,995 篇 电气工程
    • 3,162 篇 软件工程
    • 2,715 篇 信息与通信工程
    • 1,965 篇 控制科学与工程
    • 740 篇 机械工程
    • 679 篇 电子科学与技术(可...
    • 626 篇 航空宇航科学与技...
    • 531 篇 仪器科学与技术
    • 228 篇 交通运输工程
    • 213 篇 材料科学与工程(可...
    • 204 篇 化学工程与技术
    • 168 篇 生物工程
    • 159 篇 测绘科学与技术
    • 139 篇 生物医学工程(可授...
    • 135 篇 土木工程
    • 133 篇 动力工程及工程热...
  • 10,434 篇 理学
    • 9,336 篇 数学
    • 916 篇 物理学
    • 769 篇 系统科学
    • 733 篇 统计学(可授理学、...
    • 262 篇 生物学
    • 246 篇 化学
    • 128 篇 地球物理学
  • 2,485 篇 管理学
    • 1,920 篇 管理科学与工程(可...
    • 674 篇 工商管理
    • 560 篇 图书情报与档案管...
  • 413 篇 经济学
    • 384 篇 应用经济学
  • 206 篇 医学
    • 174 篇 临床医学
  • 170 篇 法学
    • 168 篇 社会学
  • 131 篇 文学
  • 128 篇 农学
  • 36 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,150 篇 approximation al...
  • 2,771 篇 algorithm design...
  • 2,362 篇 optimization
  • 2,318 篇 approximation me...
  • 2,188 篇 heuristic algori...
  • 1,428 篇 convergence
  • 1,417 篇 linear programmi...
  • 1,285 篇 computational mo...
  • 1,219 篇 resource managem...
  • 1,168 篇 signal processin...
  • 956 篇 computer science
  • 924 篇 polynomials
  • 921 篇 clustering algor...
  • 916 篇 complexity theor...
  • 785 篇 mathematical mod...
  • 766 篇 vectors
  • 721 篇 programming
  • 650 篇 estimation
  • 643 篇 training
  • 608 篇 transportation

机构

  • 97 篇 univ maryland de...
  • 68 篇 technion israel ...
  • 56 篇 univ waterloo de...
  • 53 篇 cornell univ dep...
  • 44 篇 tsinghua univers...
  • 39 篇 national institu...
  • 39 篇 iit dept comp sc...
  • 39 篇 carnegie mellon ...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 33 篇 nanjing univ sta...
  • 32 篇 sichuan univ col...
  • 32 篇 swiss fed inst t...
  • 31 篇 school of comput...
  • 31 篇 max planck inst ...
  • 30 篇 univ chinese aca...
  • 30 篇 mit cambridge ma...
  • 29 篇 technion haifa
  • 29 篇 suny stony brook...
  • 28 篇 epfl

作者

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

语言

  • 30,927 篇 英文
  • 1,066 篇 其他
  • 117 篇 中文
  • 9 篇 日文
  • 6 篇 俄文
  • 2 篇 西班牙文
  • 2 篇 法文
  • 1 篇 土耳其文
  • 1 篇 乌克兰文
检索条件"主题词=approximation algorithms"
32150 条 记 录,以下是2011-2020 订阅
排序:
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms
收藏 引用
Optimization Letters 2023年 第8期17卷 1853-1872页
作者: Yang, Yongge Chen, Po-An Lee, Yu-Ching Fanchiang, Yung-Yan Department of Industrial Engineering and Engineering Management National Tsing Hua University 101 Section 2 Kuang-Fu Road Hsinchu City300044 Taiwan Institute of Information Management National Yang Ming Chiao Tung University 1001 University Road Hsinchu City300010 Taiwan
When an infectious disease spreads, how to quickly vaccinate with a limited budget per time step to reduce the impact of the virus is very important. Specifically, vaccination will be carried out in every time step, a... 详细信息
来源: 评论
Sharp Convergence Rates for Matching Pursuit
收藏 引用
IEEE Transactions on Information Theory 2025年 第7期71卷 5556-5569页
作者: Klusowski, Jason M. Siegel, Jonathan W. PrincetonNJ08544 United States Texas A and M University Department of Mathematics College StationTX77843 United States
We study the fundamental limits of matching pursuit, or the pure greedy algorithm, for approximating a target function f by a linear combination fn of n elements from a dictionary. When the target function is containe... 详细信息
来源: 评论
Makespan Minimization for Scheduling on Heterogeneous Platforms with Precedence Constraints  30th
Makespan Minimization for Scheduling on Heterogeneous Platfo...
收藏 引用
30th European Conference on Parallel and Distributed Processing (Euro-Par)
作者: Fagnon, Vincent Lucarelli, Giorgio Rapine, Christophe Univ Lorraine LCOMS Metz France
Taking a good decision about the assignment of each job becomes crucial in the era of hybrid and heterogeneous computing systems, such as personal machines equipped with CPUs and GPUs, or HPC platforms composed of mul... 详细信息
来源: 评论
Covering Rectilinear Polygons with Area-Weighted Rectangles
Covering Rectilinear Polygons with Area-Weighted Rectangles
收藏 引用
Symposium on Algorithm Engineering and Experiments (ALENEX)
作者: Hanauer, Kathrin Seybold, Martin P. Unterweger, Julian Univ Vienna Fac Comp Sci Vienna Austria
Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weig... 详细信息
来源: 评论
An Efficient Approximate Expectation Propagation Detector With Block-Diagonal Neumann-Series
收藏 引用
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2023年 第3期70卷 1403-1416页
作者: Wang, Huizheng Cheng, Bingyang Tan, Xiaosi You, Xiaohu Zhang, Chuan Southeast Univ Natl Mobile Commun Res Lab LEADS Nanjing 211189 Peoples R China Southeast Univ Frontiers Sci Ctr Mobile Informat Commun & Secur Nanjing 211189 Peoples R China Purple Mt Labs Nanjing 211189 Peoples R China
Expectation propagation (EP) achieves near-optimal performance for large-scale multiple-input multiple-output (L-MIMO) detection, however, at the expense of unaffordable matrix inversions. To tackle the issue, several... 详细信息
来源: 评论
Sampling for Beyond-Worst-Case Online Ranking  38
Sampling for Beyond-Worst-Case Online Ranking
收藏 引用
38th AAAI Conference on Artificial Intelligence (AAAI) / 36th Conference on Innovative Applications of Artificial Intelligence / 14th Symposium on Educational Advances in Artificial Intelligence
作者: Chen, Qingyun Im, Sungjin Moseley, Benjamin Xu, Chenyang Zhang, Ruilong Univ Calif Merced Elect Engn & Comp Sci Merced CA USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China Univ Buffalo Dept Comp Sci & Engn Buffalo NY USA
The feedback arc set problem is one of the most fundamental and well-studied ranking problems where n objects are to be ordered based on their pairwise comparison. The problem enjoys several efficient approximation al... 详细信息
来源: 评论
Promoting Counterfactual Robustness through Diversity  38
Promoting Counterfactual Robustness through Diversity
收藏 引用
38th AAAI Conference on Artificial Intelligence (AAAI) / 36th Conference on Innovative Applications of Artificial Intelligence / 14th Symposium on Educational Advances in Artificial Intelligence
作者: Leofante, Francesco Potyka, Nico Imperial Coll London Dept Comp London England Cardiff Univ Sch Comp Sci & Informat Cardiff Wales
Counterfactual explanations shed light on the decisions of black-box models by explaining how an input can be altered to obtain a favourable decision from the model (e.g., when a loan application has been rejected). H... 详细信息
来源: 评论
Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids  15
Simple and Optimal Online Contention Resolution Schemes for ...
收藏 引用
15th Innovations in Theoretical Computer Science Conference (ITCS)
作者: Dinev, Atanas Weinberg, S. Matthew MIT 77 Massachusetts Ave Cambridge MA 02139 USA Princeton Univ Princeton NJ 08544 USA
We provide a simple (1 - O(1/root k))-selectable Online Contention Resolution Scheme for k-uniform matroids against a fixed-order adversary. If A(i) and G(i) denote the set of selected elements and the set of realized... 详细信息
来源: 评论
PANTR: A Proximal Algorithm With Trust-Region Updates for Nonconvex Constrained Optimization
收藏 引用
IEEE CONTROL SYSTEMS LETTERS 2023年 7卷 2389-2394页
作者: Bodard, Alexander Pas, Pieter Patrinos, Panagiotis Katholieke Univ Leuven Dept Elect Engn ESAT STADIUS B-3001 Leuven Belgium
This letter presents PANTR, an efficient solver for nonconvex constrained optimization problems, that is well-suited as an inner solver for an augmented Lagrangian method. The proposed scheme combines forward-backward... 详细信息
来源: 评论
Understanding the Cluster Linear Program for Correlation Clustering  2024
Understanding the Cluster Linear Program for Correlation Clu...
收藏 引用
56th Annual ACM Symposium on Theory of Computing (STOC)
作者: Cao, Nairen Cohen-Addad, Vincent Lee, Euiwoong Li, Shi Newman, Alantha Vogl, Lukas Boston Coll Brighton MA 02135 USA Google Res Grenoble France Univ Michigan Ann Arbor MI 48109 USA Nanjing Univ Dept Comp Sci & Technol Nanjing Peoples R China Univ Grenoble Alpes CNRS Grenoble France Ecole Polytech Fed Lausanne Lausanne Switzerland
In the classic Correlation Clustering problem introduced by Bansal, Blum, and Chawla (FOCS 2002), the input is a complete graph where edges are labeled either + or -, and the goal is to find a partition of the vertice... 详细信息
来源: 评论