咨询与建议

限定检索结果

文献类型

  • 2,582 篇 会议
  • 744 篇 期刊文献
  • 7 篇 学位论文
  • 2 册 图书

馆藏范围

  • 3,335 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,375 篇 工学
    • 698 篇 电气工程
    • 695 篇 计算机科学与技术...
    • 336 篇 信息与通信工程
    • 182 篇 控制科学与工程
    • 127 篇 软件工程
    • 97 篇 仪器科学与技术
    • 61 篇 电子科学与技术(可...
    • 50 篇 机械工程
    • 41 篇 交通运输工程
    • 16 篇 石油与天然气工程
    • 10 篇 生物医学工程(可授...
    • 9 篇 动力工程及工程热...
    • 8 篇 网络空间安全
    • 7 篇 土木工程
    • 6 篇 光学工程
  • 387 篇 理学
    • 247 篇 数学
    • 64 篇 系统科学
    • 54 篇 物理学
    • 21 篇 生物学
    • 18 篇 统计学(可授理学、...
    • 8 篇 化学
    • 5 篇 地球物理学
  • 144 篇 管理学
    • 139 篇 管理科学与工程(可...
    • 8 篇 工商管理
  • 28 篇 医学
    • 20 篇 临床医学
    • 7 篇 基础医学(可授医学...
    • 5 篇 特种医学
  • 24 篇 文学
    • 23 篇 新闻传播学
  • 17 篇 经济学
    • 12 篇 应用经济学
    • 6 篇 理论经济学
  • 6 篇 法学
  • 6 篇 教育学
  • 3 篇 农学
  • 2 篇 军事学
  • 2 篇 艺术学

主题

  • 3,335 篇 greedy algorithm...
  • 353 篇 approximation al...
  • 318 篇 algorithm design...
  • 311 篇 optimization
  • 286 篇 heuristic algori...
  • 216 篇 computer science
  • 200 篇 resource managem...
  • 178 篇 computational mo...
  • 172 篇 costs
  • 154 篇 routing
  • 147 篇 genetic algorith...
  • 131 篇 linear programmi...
  • 115 篇 clustering algor...
  • 110 篇 wireless sensor ...
  • 103 篇 matching pursuit...
  • 102 篇 computational co...
  • 99 篇 compressed sensi...
  • 97 篇 bandwidth
  • 95 篇 vectors
  • 94 篇 conferences

机构

  • 10 篇 univ s carolina ...
  • 8 篇 univ texas austi...
  • 8 篇 harbin institute...
  • 7 篇 univ waterloo de...
  • 7 篇 univ athens dept...
  • 7 篇 univ penn dept e...
  • 6 篇 univ calif santa...
  • 6 篇 beijing universi...
  • 5 篇 national mobile ...
  • 5 篇 texas a&m univ d...
  • 5 篇 school of comput...
  • 5 篇 univ maryland de...
  • 5 篇 school of comput...
  • 5 篇 department of co...
  • 5 篇 school of comput...
  • 5 篇 school of inform...
  • 5 篇 stanford univ de...
  • 5 篇 temple univ dept...
  • 4 篇 school of comput...
  • 4 篇 ohio state univ ...

作者

  • 9 篇 borodin allan
  • 8 篇 jun li
  • 8 篇 wei wang
  • 7 篇 yu wang
  • 7 篇 theodoridis serg...
  • 7 篇 nonomura taku
  • 6 篇 xi chen
  • 6 篇 saito yuji
  • 6 篇 vandergheynst pi...
  • 6 篇 yamada keigo
  • 6 篇 grimsman david
  • 6 篇 marden jason r.
  • 6 篇 chatterjee saika...
  • 6 篇 jie wu
  • 6 篇 haasdonk bernard
  • 6 篇 moshkov mikhail
  • 6 篇 yang liu
  • 6 篇 nagata takayuki
  • 6 篇 wu weili
  • 5 篇 sundaram shreyas

语言

  • 3,280 篇 英文
  • 40 篇 其他
  • 14 篇 中文
  • 2 篇 俄文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=greedy algorithms"
3335 条 记 录,以下是81-90 订阅
排序:
greedy algorithms for Client Assignment in Large-Scale Distributed Virtual Environments
Greedy Algorithms for Client Assignment in Large-Scale Distr...
收藏 引用
Workshop on Principles of Advanced and Distributed Simulation (PADS)
作者: Duong Nguyen Binh Ta Suiping Zhou Haifeng Shen Shen Parallel & Distributed Computing Centre Nanyang Technological University Singapore
Distributed Virtual Environments (DVEs), such as online games, military simulations, collaborative design, etc., are very popular nowadays. To support large-scale DVEs, a multi-server architecture is usually employed,... 详细信息
来源: 评论
greedy algorithms for Maximizing Nash Social Welfare  18
Greedy Algorithms for Maximizing Nash Social Welfare
收藏 引用
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems
作者: Siddharth Barman Sanath Kumar Krishnamurthy Rohit Vaish Indian Institute of Science Bangalore India Chennai Mathematical Institute Kelambakkam India
We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean o... 详细信息
来源: 评论
greedy algorithms for the shortest common superstring that are asymptotically optimal
Greedy algorithms for the shortest common superstring that a...
收藏 引用
IEEE International Symposium on Information Theory
作者: A. Frieze W. Szpankowski Department of Mathematics Carnegie Mellon University Pittsburgh PA USA Department Computer Science Purdue University West Lafayette IN USA
Various versions of the shortest common superstring (SCS) problem play important roles in data compression and DNA sequencing. For example, in laboratories DNA sequencing is routinely done by sequencing large numbers ... 详细信息
来源: 评论
greedy algorithms, Ordering of Variables, and d-degenerate Instances
Greedy Algorithms, Ordering of Variables, and d-degenerate I...
收藏 引用
International Symposium on Multiple-Valued Logic
作者: Cong Wang Andrei A. Bulatov School of Computing Science Simon Fraser University Burnaby Canada
We consider the MAX-2-SAT problem on d-degenerate formulas. This class of 2-CNFs is a generalization of 2-CNFs of bounded tree width. We first show that the class of d-degenerate formulas is very broad, since random f... 详细信息
来源: 评论
greedy algorithms in convex optimization on Banach spaces
Greedy algorithms in convex optimization on Banach spaces
收藏 引用
Asilomar Conference on Signals, Systems & Computers
作者: Vladimir Temlyakov Department of Mathematics University of South Carolina Columbia SC USA
Chebyshev greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces. We apply this algorithm for constructing sparse approximate solutio... 详细信息
来源: 评论
greedy algorithms in coding theory
Greedy algorithms in coding theory
收藏 引用
IEEE Convention of the Electrical and ELectronic Engineers in Israel
作者: G. Cohen S. Litsyn G. Zemor ENST Paris France Tel-Aviv University Israel
A wide class of problems in coding theory are dealt with using a greedy algorithm due to Stein (1974) and Lovasz (1975). Some examples, including constructing covering codes, codes for conflict resolution, separating ... 详细信息
来源: 评论
greedy algorithms for dynamic graph coloring
Greedy algorithms for dynamic graph coloring
收藏 引用
International Conference on Communications, Computing and Control Applications (CCCA)
作者: Linda Ouerfelli Hend Bouziri ISG University of Tunis Tunisia ESSEC University of Tunis Tunisia
Many real life applications are subject to changes which can be modeled as dynamic graphs. In this paper, we are interested especially in the dynamic graph coloring. We focus on coloring using online algorithms and we... 详细信息
来源: 评论
An Experimental Method for the Active Learning of greedy algorithms
收藏 引用
ACM TRANSACTIONS ON COMPUTING EDUCATION 2013年 第4期13卷 18-18页
作者: Velazquez-Iturbide, J. Angel Univ Rey Juan Carlos Dept Lenguajes & Sistemas Informat C Tulipan S-N Madrid 28933 Spain
greedy algorithms constitute an apparently simple algorithm design technique, but its learning goals are not simple to achieve. We present a didactic method aimed at promoting active learning of greedy algorithms. The... 详细信息
来源: 评论
Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted greedy Heuristics (EAGH)
收藏 引用
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2011年 第9期62卷 1704-1710页
作者: Corominas, A. Pastor, R. Tech Univ Catalonia UPC IOC Inst Ind & Control Engn Barcelona 08028 Spain
This paper introduces Empirically Adjusted greedy Heuristics (EAGH), a procedure for designing greedy algorithms for a given combinatorial optimization problem and illustrates the way in which EAGH works with an appli... 详细信息
来源: 评论
greedy Reconfiguration algorithms for Medium-Voltage Distribution Networks
收藏 引用
IEEE TRANSACTIONS ON POWER DELIVERY 2009年 第1期24卷 328-337页
作者: Carcamo-Gallardo, Angely Garcia-Santander, Luis Pezoa, Jorge E. Univ New Mexico Dept Econ Albuquerque NM 87131 USA Univ Concepcion Dept Ingn Elect Concepcion Chile Univ New Mexico Elect & Comp Engineer Dept Albuquerque NM 87131 USA
In this paper, we present the greedy reconfiguration algorithm (GRA) and the fast greedy reconfiguration algorithm (FGRA)-two reconfiguration algorithms that minimize the energy not supplied (ENS) of medium-voltage (M... 详细信息
来源: 评论