咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 31,962 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 15,965 篇 工学
    • 10,069 篇 计算机科学与技术...
    • 4,864 篇 电气工程
    • 3,097 篇 软件工程
    • 2,689 篇 信息与通信工程
    • 1,952 篇 控制科学与工程
    • 737 篇 机械工程
    • 681 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 232 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 147 篇 测绘科学与技术
    • 134 篇 动力工程及工程热...
    • 134 篇 生物医学工程(可授...
    • 133 篇 土木工程
  • 10,418 篇 理学
    • 9,357 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 742 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
  • 2,485 篇 管理学
    • 1,929 篇 管理科学与工程(可...
    • 672 篇 工商管理
    • 554 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 207 篇 医学
    • 171 篇 临床医学
  • 179 篇 法学
    • 166 篇 社会学
  • 128 篇 文学
    • 123 篇 新闻传播学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,962 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,333 篇 optimization
  • 2,306 篇 approximation me...
  • 2,156 篇 heuristic algori...
  • 1,421 篇 linear programmi...
  • 1,403 篇 convergence
  • 1,272 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,137 篇 signal processin...
  • 955 篇 computer science
  • 910 篇 polynomials
  • 906 篇 clustering algor...
  • 905 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 741 篇 vectors
  • 712 篇 programming
  • 647 篇 estimation
  • 614 篇 transportation
  • 608 篇 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 篇 tel aviv univers...
  • 28 篇 max planck inst ...

作者

  • 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,238 篇 英文
  • 576 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31962 条 记 录,以下是701-710 订阅
排序:
A METHOD FOR ACCELERATING THE FIRST-ORDER STOCHASTIC-approximation algorithms
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1981年 第2期26卷 573-575页
作者: UNTON, FZ Systems Research Institute Polish Academy of Sciences Warsaw Mazowieckie Poland
The main problem considered is the method of choosing step coefficients in first-order stochastic approximation algorithms for system identification. The proposed method increases the efficency of the Saridis and Stei... 详细信息
来源: 评论
LINEAR-TIME approximation algorithms FOR FINDING THE MINIMUM-WEIGHT PERFECT MATCHING ON A PLANE
收藏 引用
INFORMATION PROCESSING LETTERS 1981年 第4期12卷 206-209页
作者: IRI, M MUROTA, K MATSUI, S Department of Mathematical Engineering and Instrumentation Physics University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo Japan 113
Consideration is given to the problem of determining the minimum-weight perfect matching of an even number of points on a plane, i.e., determining how to match the points in pairs so as to minimize the sum of the dist... 详细信息
来源: 评论
DESIGN AND ANALYSIS OF SUCCESSIVE approximation algorithms VIA BILINEAR CONTROL-THEORY
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1981年 第3期26卷 770-773页
作者: DESROCHERS, AA Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY USA
Gradient techniques which use a weighting matrix to accelerate convergence are shown to be bilinear in the neighborhood of the extremum, while the gradient method itself behaves as a linear system. An investigation of... 详细信息
来源: 评论
Outer approximation algorithms for DC programs and beyond
收藏 引用
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2010年 第3期8卷 323-326页
作者: Zhang, Qinghua Univ Pisa Dipartimento Informat I-56127 Pisa Italy
This paper is a summary of the author's Ph.D. thesis in Mathematics supervised by Giancarlo Bigi and Antonio Frangioni, and defended on 23 June 2008 at the Universita di Pisa. The thesis is written in English and ... 详细信息
来源: 评论
approximation algorithms for MAX SAT
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2000年 第3期E83D卷 488-495页
作者: Hirata, T Ono, T Nagoya Univ Sch Engn Nagoya Aichi 4648603 Japan
Maximum Satisfiability Problem (MAX SAT) is one of the most natural optimization problems. Since it is known to Le NP-hard, approximation algorithms have been considered. The aim of this survey is to show recent devel... 详细信息
来源: 评论
approximation algorithms for Schema-Mapping Discovery from Data Examples
收藏 引用
ACM TRANSACTIONS ON DATABASE SYSTEMS 2017年 第2期42卷 12-12页
作者: Ten Cate, Balder Kolaitis, Phokion G. Qian, Kun Tan, Wang-Chiew UC Santa Cruz Santa Cruz CA 95064 USA IBM Res Almaden San Jose CA USA Recruit Inst Technol Mountain View CA 94041 USA Univ Calif Santa Cruz Comp Sci Dept 1156 High St Santa Cruz CA 95064 USA
In recent years, data examples have been at the core of several different approaches to schema-mapping design. In particular, Gottlob and Senellart introduced a framework for schema-mapping discovery from a single dat... 详细信息
来源: 评论
approximation algorithms for Computing Minimum Exposure Paths in a Sensor Field
收藏 引用
ACM TRANSACTIONS ON SENSOR NETWORKS 2010年 第3期7卷 1–25页
作者: Djidjev, Hristo N. Los Alamos Natl Lab Los Alamos NM 87545 USA
The exposure of a path p in a sensor field is a measure of the likelihood that an object traveling along p is detected by at least one sensor from a network of sensors, and is formally defined as an integral over all ... 详细信息
来源: 评论
approximation algorithms for inner-node weighted minimum spanning trees
收藏 引用
COMPUTER SYSTEMS SCIENCE AND ENGINEERING 2009年 第3期24卷 189-195页
作者: Peng, Chao Tan, Yasuo Xiong, Naixue Yang, Laurence T. Zhu, Hong Japan Adv Inst Sci & Technol Grad Sch Informat Sci Kanazawa Ishikawa Japan New Generat Network Res Ctr Natl Inst Informat & Commun Technol Tokyo Japan Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 2W5 Canada Fudan Univ Dept Comp Sci & Engn Shanghai Peoples R China
This paper addresses the Inner-node Weighted Minimum Spanning Tree Problem (IWMST), which asks for a spanning tree in a graph G = (V. E) (vertical bar V vertical bar = n. vertical bar E vertical bar = m) with the mini... 详细信息
来源: 评论
approximation algorithms for vehicle-aided periodic data collection from mobile sensors with obstacle avoidance in WSNs
收藏 引用
AD HOC NETWORKS 2023年 149卷
作者: Kumar, Rohit Mukherjee, Joy Chandra Indian Inst Technol Bhubaneswar Sch Elect Sci Bhubaneswar 752050 India
Data collection from the sensors in time is an integral part of many applications of wireless sensor networks (WSNs). Vehicles, referred to as Mobile Sinks (SNKs), may be used to collect data from the sensors by visit... 详细信息
来源: 评论
approximation algorithms FOR NP-COMPLETE PROBLEMS ON PLANAR GRAPHS
收藏 引用
JOURNAL OF THE ACM 1994年 第1期41卷 153-180页
作者: BAKER, BS AT&T Bell Labs. Murray Hill NJ
This paper describes a general technique that can be used to obtain approximation schemes for various NP-complete problems on planar graphs. The strategy depends on decomposing a planar graph into subgraphs of a form ... 详细信息
来源: 评论