咨询与建议

限定检索结果

文献类型

  • 22,831 篇 会议
  • 9,109 篇 期刊文献
  • 64 篇 学位论文
  • 1 册 图书

馆藏范围

  • 32,005 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

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

主题

  • 32,005 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,342 篇 optimization
  • 2,306 篇 approximation me...
  • 2,165 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,409 篇 convergence
  • 1,277 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,140 篇 signal processin...
  • 957 篇 computer science
  • 914 篇 polynomials
  • 908 篇 clustering algor...
  • 906 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 745 篇 vectors
  • 712 篇 programming
  • 648 篇 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,281 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32005 条 记 录,以下是701-710 订阅
排序:
approximation algorithms for sorting by signed short reversals  14
Approximation algorithms for sorting by signed short reversa...
收藏 引用
5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, ACM BCB 2014
作者: Galvão, Gustavo Rodrigues Dias, Zanoni Institute of Computing University of Campinas - Unicamp Av. Albert Einstein 1251 Campinas São Paulo13083-852 Brazil
During evolution, global mutations may modify the gene order in a genome. Such mutations are commonly referred to as rearrangement events. One of the most frequent rearrangement events observed in genomes are reversal... 详细信息
来源: 评论
Stochastic approximation search algorithms with randomization at the input
收藏 引用
AUTOMATION AND REMOTE CONTROL 2015年 第5期76卷 762-775页
作者: Granichin, O. N. St Petersburg State Univ St Petersburg 199034 Russia
This work presents a comprehensive survey of the development of pseudogradient stochastic approximation algorithms with randomized input disturbance, considers the problems of their applicability in optimization probl... 详细信息
来源: 评论
approximation algorithms Inspired by Kernelization Methods
Approximation Algorithms Inspired by Kernelization Methods
收藏 引用
25th International Symposium on algorithms and Computation (ISAAC)
作者: Abu-Khzam, Faisal N. Bazgan, Cristina Chopin, Morgan Fernau, Henning Lebanese Amer Univ Beirut Lebanon Univ Paris 09 PSL LAMSADE UMR 7243 Paris France Univ Ulm Inst Optimierung & Operat Res D-89069 Ulm Germany Univ Trier Fachbereich 4 Informat Wissensch Trier Germany Inst Univ France Paris France
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynom... 详细信息
来源: 评论
Tight approximation Ratios of Two Greedy algorithms for Optimal RSU Deployment in One-Dimensional VANETs
收藏 引用
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年 第1期70卷 3-17页
作者: Gao, Zhenguo Wu, Hsiao-Chun Cai, Shaobin Tan, Guozhen Huaqiao Univ Dept Comp Sci & Technol Xiamen 361021 Peoples R China Fujian Prov Univ Huaqiao Univ Key Lab Comp Vis & Machine Learning Xiamen 361021 Peoples R China Louisiana State Univ Sch Elect Engn & Comp Sci Baton Rouge LA 70803 USA Dalian Univ Technol Sch Comp Sci & Technol Dalian 116024 Peoples R China
For addressing the One-Dimensional Road side unit Deployment (D1RD) problem, a greedy approximate algorithm named Greedy2P3E was proposed two years ago, and its approximation ratio was proved to be at least 2/3 for th... 详细信息
来源: 评论
approximation algorithms for the street sweeping problem  11
Approximation algorithms for the street sweeping problem
收藏 引用
2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control, CCE 2014
作者: ͆anchez, L. F. Herńandez Lomelí, L. E. Chávez Martínez, F. J. Zaragoza Posgrado en Optimización UAM Azcapotzalco Mexico City Mexico Departamento de Ciencias Básicas UAM Azcapotzalco Mexico City Mexico Departamento de Sistemas UAM Azcapotzalco Mexico City Mexico
The Street sweeping problem (SSP) is a variation of the Windy postman problem (WPP) in which we must construct two tours traversing every edge, and each edge must be traversed once in each direction: one on the first ... 详细信息
来源: 评论
A generic framework for approximation analysis of greedy algorithms for star bicoloring
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 2021年 第4期36卷 869-890页
作者: Juedes, David W. Jones, Jeffrey S. Ohio Univ Sch Elect Engn & Comp Sci Athens OH 45701 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA
This paper presents a generic framework for the design and comparison of polynomial-time approximation algorithms for MINIMUM STAR BICOLORING. This generic framework is parameterized by algorithms which produce sequen... 详细信息
来源: 评论
Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion approximation algorithms  15
Bayesian Truthful Mechanisms for Job Scheduling from Bi-crit...
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Constantinos Daskalakis S. Matthew Weinberg EECS MIT
We provide polynomial-time approximately optimal Bayesian mechanisms for makespan minimization on unrelated machines as well as for max-min fair allocations of indivisible goods, with approximation factors of 2 and mi... 详细信息
来源: 评论
Hardness results, approximation and exact algorithms for liar's domination problem in graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 573卷 26-42页
作者: Panda, B. S. Paul, S. Pradhan, D. Indian Inst Technol Delhi Dept Math Comp Sci & Applicat Grp New Delhi 110016 India Indian Inst Technol Jodhpur 342011 Rajasthan India
A subset L subset of V of a graph G = (V, E) is called a liar's dominating set of G if (i) vertical bar N-G[u] boolean AND L vertical bar >= 2 for every vertex u is an element of V, and (ii) vertical bar N-G [u... 详细信息
来源: 评论
Network Clustering via Maximizing Modularity: approximation algorithms and Theoretical Limits
Network Clustering via Maximizing Modularity: Approximation ...
收藏 引用
IEEE International Conference on Data Mining
作者: Thang N. Dinh Xiang Li My T. Thai Department of Computer Science Virginia Commonwealth University Dept. of Comp. & Info. Sci. & Eng. University of Florida
Many social networks and complex systems are found to be naturally divided into clusters of densely connected nodes, known as community structure (CS). Finding CS is one of fundamental yet challenging topics in networ... 详细信息
来源: 评论
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... 详细信息
来源: 评论