咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
排序:
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
收藏 引用
JOURNAL OF HEURISTICS 2009年 第4期15卷 331-349页
作者: Gortz, Simon Klose, Andreas Univ Aarhus Dept Math Sci DK-8000 Aarhus C Denmark Univ Wuppertal Fac Econ & Social Sci D-42197 Wuppertal Germany
The single-sink fixed-charge transportation problem (SSFCTP) consists of finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a... 详细信息
来源: 评论
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2013年 第2期230卷 212-225页
作者: Glover, Fred OptTek Syst Inc Boulder CO 80302 USA
New variants of greedy algorithms, called advanced greedy algorithms, are identified for knapsack and covering problems with linear and quadratic objective functions. Beginning with single-constraint problems, we prov... 详细信息
来源: 评论
greedy algorithms make efficient mechanisms  15
Greedy algorithms make efficient mechanisms
收藏 引用
16th ACM Conference on Economics and Computation, EC 2015
作者: Lucier, Brendan Syrgkanis, Vasilis Microsoft Research CambridgeMA United States
We study mechanisms that use greedy allocation rules and pay-your-bid pricing to allocate resources subject to a matroid constraint. We show that all such mechanisms obtain a constant fraction of the optimal welfare a... 详细信息
来源: 评论
Sparse Approximation and Recovery by greedy algorithms
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2014年 第7期60卷 3989-4000页
作者: Livshitz, Eugene D. Temlyakov, Vladimir N. Evernote Corp Moscow 121087 Russia Moscow MV Lomonosov State Univ Moscow 121087 Russia Univ S Carolina Columbia SC 29208 USA Steklov Inst Math Moscow 119991 Russia
We study sparse approximation by greedy algorithms. Our contribution is twofold. First, we prove exact recovery with high probability of random K-sparse signals within [K(1+ epsilon)] iterations of the orthogonal matc... 详细信息
来源: 评论
Heuristic Scheduling of Batch Production Processes Based on Petri Nets and Iterated greedy algorithms
收藏 引用
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2022年 第1期19卷 251-261页
作者: Zhao, Ziyan Liu, Shixin Zhou, Mengchu You, Dan Guo, Xiwang Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Peoples R China Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Macau Univ Sci & Technol Inst Syst Engn Macau 999078 Peoples R China Macau Univ Sci & Technol Collaborat Lab Intelligent Sci & Syst Macau 999078 Peoples R China Univ Cagliari Dept Elect & Elect Engn I-09123 Cagliari Italy Liaoning Shihua Univ Comp & Commun Engn Coll Fushun 113001 Peoples R China
Wire rod and bar rolling is an important batch production process in steel production systems. A scheduling problem originated from this process is studied in this work by considering the constraints on sequence-depen... 详细信息
来源: 评论
Some greedy algorithms for sparse polynomial chaos expansions
收藏 引用
JOURNAL OF COMPUTATIONAL PHYSICS 2019年 第0期387卷 303-325页
作者: Baptista, Ricardo Stolbunov, Valentin Nair, Prasanth B. Univ Toronto Inst Aerosp Studies Toronto ON M3H 5T6 Canada MIT 77 Massachusetts Ave Cambridge MA 02139 USA
Compressed sensing algorithms approximate functions using limited evaluations by searching for a sparse representation among a dictionary of basis functions. Orthogonal matching pursuit (OMP) is a greedy algorithm for... 详细信息
来源: 评论
ON greedy algorithms FOR SERIES-PARALLEL GRAPHS
收藏 引用
MATHEMATICAL PROGRAMMING 1988年 第2期40卷 197-204页
作者: HOFFMAN, AJ 1.Department of Mathematical Sciences IBM Thomas J. Watson Research Center P.O. Box 218 10598 Yorktown Heights NY USA
This note describes some sufficient conditions for the maximum or minimum of a weighted flow (the weights are on paths, and are derived from weights on the edges of the path), of given volume in a series parallel grap... 详细信息
来源: 评论
Iterated greedy algorithms for Flow-Shop Scheduling Problems: A Tutorial
收藏 引用
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2022年 第3期19卷 1941-1959页
作者: Zhao, ZiYan Zhou, MengChu Liu, ShiXin Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Peoples R China Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Macau Univ Sci & Technol Inst Syst Engn Macau 999078 Peoples R China Macau Univ Sci & Technol Collaborat Lab Intelligent Sci & Syst Macau 999078 Peoples R China
An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling problems. IGA was first de... 详细信息
来源: 评论
greedy algorithms as locally stratified logic programs  22
Greedy algorithms as locally stratified logic programs
收藏 引用
22nd Italian Symposium on Advanced Database Systems, SEBD 2014
作者: Zaniolo, Carlo University of California Los Angeles United States
The problem of expressing and supporting classical greedy algorithms in Datalog has been the focus of significant research efforts that have produced very interesting specific solutions. But we still lack general trea... 详细信息
来源: 评论
GRAPH SPARSIFICATION BY UNIVERSAL greedy algorithms
收藏 引用
Journal of Computational Mathematics 2023年 第4期41卷 741-770页
作者: Ming-Jun Lai Jiaxin Xie Zhiqiang Xu Department of Mathematics University of GeorgiaAthensGA 30602USA LMIB of the Ministry of Education School of Mathematical SciencesBeihang UniversityBeijing 100191China LSEC Inst.Comp.Math.Academy of Mathematics and System ScienceChinese Academy of SciencesBeijing 100091China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China
Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications,such as simplification of social networks,least squares problems,and numerical solution of symmetric posit... 详细信息
来源: 评论