咨询与建议

限定检索结果

文献类型

  • 22,842 篇 会议
  • 9,117 篇 期刊文献
  • 64 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 16,011 篇 工学
    • 10,098 篇 计算机科学与技术...
    • 4,885 篇 电气工程
    • 3,122 篇 软件工程
    • 2,683 篇 信息与通信工程
    • 1,951 篇 控制科学与工程
    • 738 篇 机械工程
    • 679 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 229 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 153 篇 测绘科学与技术
    • 134 篇 土木工程
    • 134 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,437 篇 理学
    • 9,372 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 737 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
    • 126 篇 地球物理学
  • 2,490 篇 管理学
    • 1,927 篇 管理科学与工程(可...
    • 674 篇 工商管理
    • 557 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 180 篇 法学
    • 167 篇 社会学
  • 128 篇 文学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,023 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,345 篇 optimization
  • 2,306 篇 approximation me...
  • 2,167 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,411 篇 convergence
  • 1,278 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,141 篇 signal processin...
  • 956 篇 computer science
  • 914 篇 polynomials
  • 909 篇 complexity theor...
  • 908 篇 clustering algor...
  • 789 篇 mathematical mod...
  • 752 篇 vectors
  • 712 篇 programming
  • 652 篇 estimation
  • 614 篇 transportation
  • 612 篇 training

机构

  • 97 篇 univ maryland de...
  • 70 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 49 篇 cornell univ dep...
  • 43 篇 tsinghua univers...
  • 39 篇 national institu...
  • 39 篇 carnegie mellon ...
  • 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...

作者

  • 64 篇 woodruff david p...
  • 64 篇 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
  • 29 篇 zenklusen rico
  • 28 篇 saha barna
  • 27 篇 dinitz michael

语言

  • 31,298 篇 英文
  • 573 篇 其他
  • 113 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32023 条 记 录,以下是711-720 订阅
排序:
Efficient approximation algorithms to determine minimum partial dominating sets in social networks
Efficient approximation algorithms to determine minimum part...
收藏 引用
IEEE International Conference on Big Data
作者: Alina Campan Traían Marius Truta Matthew Beckerich Computer Science Department Northern Kentucky University Highland Heights KY U.S.A
In this paper we report on extensive experiments for determining partial dominating sets of small size for various types of real and synthetic social networks. Our experiments ran on several real network datasets made... 详细信息
来源: 评论
Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms
Spectrum assignment in rings with shortest-path routing: Com...
收藏 引用
International Conference on Computing, Networking and Communications (ICNC)
作者: Sahar Talebi Furqan Alam Iyad Katib George N. Rouskas Operations Research and Department of Computer Science North Carolina State University Raleigh NC USA King Abdulaziz University Jeddah Saudi Arabia
We study the spectrum assignment (SA) problem in ring networks with shortest path (or, more generally, fixed) routing. With fixed routing, each traffic demand follows a predetermined path to its destination. In earlie... 详细信息
来源: 评论
Upper bounds and approximation results for the k-slow burning problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2025年 363卷 88-104页
作者: Hiller, Michaela Koster, Arie M. C. A. Pabst, Philipp Rhein Westfal TH Aachen Discrete Optimizat Aachen Germany Rhein Westfal TH Aachen Chair Management Sci Aachen Germany
k-slow burning is a model for contagion in social networks. In this model, given an undirected graph G in every time step, first every burning vertex spreads the fire to up to k of its neighbours, before second one ad... 详细信息
来源: 评论
Unraveling the Viral Spread of Misinformation: Maximum-Likelihood Estimation and Starlike Tree approximation in Markovian Spreading Models
收藏 引用
IEEE TRANSACTIONS ON SIGNAL PROCESSING 2025年 73卷 446-461页
作者: Yu, Pei-Duo Tan, Chee Wei Chung Yuan Christian Univ Taoyuan City 320314 Taiwan Nanyang Technol Univ Singapore 639798 Singapore
Identifying the source of epidemic-like spread in networks is crucial for removing internet viruses or finding the source of rumors in online social networks. The challenge lies in tracing the source from a snapshot o... 详细信息
来源: 评论
approximation algorithms for resource allocation optimization
Approximation algorithms for resource allocation optimizatio...
收藏 引用
作者: Liao, Kewen University of Adelaide
学位级别:master
Nowadays, data storage, server replicas/mirrors, virtual machines, and various kinds of services can all be regarded as different types of resources. These resources play an important role in today’s computer world b... 详细信息
来源: 评论
approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2025年 360卷 275-281页
作者: Chaplick, Steven Frohn, Martin Kelk, Steven Lottermoser, Johann Mihalak, Matus Maastricht Univ Dept Adv Comp Sci DACS Maastricht Netherlands
In this article we prove that the minimum-degree greedy algorithm, with adversarial tie-breaking, is a (2/3)-approximation for the MAXIMUM INDEPENDENT SET problem on interval graphs. We show that this is tight, even o... 详细信息
来源: 评论
Stochastic Halfspace approximation Method for Convex Optimization With Nonsmooth Functional Constraints
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年 第1期70卷 479-486页
作者: Singh, Nitesh Kumar Necoara, Ion Natl Univ Sci & Technol Politehn Bucharest Automat Control & Syst Engn Dept Bucharest 060042 Romania Romanian Acad Gheorghe Mihoc Caius Iacob Inst Math Stat & Appl M Roma TX USA
In this work, we consider convex optimization problems with smooth objective function and nonsmooth functional constraints. We propose a new stochastic gradient algorithm, called the stochastic halfspace approximation... 详细信息
来源: 评论
approximation Algorithm and Applications for Connected Submodular Function Maximization Problems
收藏 引用
IEEE TRANSACTIONS ON NETWORKING 2025年 第1期33卷 241-254页
作者: Wang, Ziming Li, Jing Xue, He Xu, Wenzheng Liang, Weifa Xu, Zichuan Peng, Jian Zhou, Pan Jia, Xiaohua Das, Sajal K. Sichuan Univ Coll Comp Sci Chengdu 610065 Peoples R China Sichuan Univ West China Hosp 2 Chengdu 610065 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Sichuan Fire Sci & Technol Res Inst MEM Chengdu 610065 Peoples R China Dalian Univ Technol Sch Software Dalian 116621 Peoples R China Huazhong Univ Sci & Technol Sch Cyber Sci & Engn Wuhan 430074 Peoples R China Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA
In this paper, we study a connected submodular function maximization problem, which arises from many applications including deploying UAV networks to serve users and placing sensors to cover Points of Interest (PoIs).... 详细信息
来源: 评论
Streaming algorithms with Large approximation Factors  25
Streaming Algorithms with Large Approximation Factors
收藏 引用
25th International Conference on approximation algorithms for Combinatorial Optimization Problems and the 26th International Conference on Randomization and Computation, APPROX/RANDOM 2022
作者: Li, Yi Lin, Honghao Woodruff, David P. Zhang, Yuheng Division of Mathematical Sciences Nanyang Technological University Singapore Computer Science Department Carnegie Mellon University PittsburghPA United States Zhiyuan College Shanghai Jiao Tong University China
We initiate a broad study of classical problems in the streaming model with insertions and deletions in the setting where we allow the approximation factor α to be much larger than 1. Such algorithms can use signific... 详细信息
来源: 评论
Hyperspectral Anomaly Detection Based on Tensor approximation With Tensor Double Nuclear Norm
收藏 引用
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 2025年 63卷
作者: Kong, Wenfeng Shen, Dunbin Li, Min Ma, Xiaorui Wang, Hongyu Dalian Univ Technol Sch Informat & Commun Engn Dalian 116024 Peoples R China
In hyperspectral anomaly detection (HAD), tensor low-rankness is essential for effectively separating background and anomaly. However, most of the current low-rank-based methods do not use the spatial-spectral low-ran... 详细信息
来源: 评论