咨询与建议

限定检索结果

文献类型

  • 1,351 篇 期刊文献
  • 909 篇 会议
  • 17 篇 学位论文
  • 1 册 图书

馆藏范围

  • 2,278 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,754 篇 工学
    • 988 篇 计算机科学与技术...
    • 599 篇 电气工程
    • 358 篇 信息与通信工程
    • 208 篇 软件工程
    • 166 篇 控制科学与工程
    • 105 篇 电子科学与技术(可...
    • 102 篇 机械工程
    • 83 篇 仪器科学与技术
    • 50 篇 航空宇航科学与技...
    • 49 篇 交通运输工程
    • 48 篇 石油与天然气工程
    • 31 篇 力学(可授工学、理...
    • 25 篇 土木工程
    • 24 篇 材料科学与工程(可...
    • 21 篇 动力工程及工程热...
    • 20 篇 环境科学与工程(可...
    • 17 篇 测绘科学与技术
    • 15 篇 网络空间安全
  • 788 篇 理学
    • 573 篇 数学
    • 92 篇 物理学
    • 57 篇 生物学
    • 47 篇 系统科学
    • 36 篇 统计学(可授理学、...
    • 25 篇 化学
    • 17 篇 地球物理学
  • 306 篇 管理学
    • 293 篇 管理科学与工程(可...
    • 36 篇 工商管理
  • 78 篇 医学
    • 45 篇 临床医学
  • 60 篇 经济学
    • 46 篇 应用经济学
    • 15 篇 理论经济学
  • 20 篇 农学
  • 8 篇 法学
  • 5 篇 教育学
  • 5 篇 军事学
  • 4 篇 文学
  • 1 篇 艺术学

主题

  • 2,278 篇 greedy algorithm
  • 100 篇 greedy algorithm...
  • 69 篇 optimization
  • 64 篇 genetic algorith...
  • 62 篇 compressed sensi...
  • 46 篇 algorithms
  • 43 篇 influence maximi...
  • 35 篇 dynamic programm...
  • 34 篇 social networks
  • 34 篇 scheduling
  • 33 篇 approximation al...
  • 32 篇 approximation al...
  • 31 篇 greedy method
  • 30 篇 matroid
  • 26 篇 combinatorial op...
  • 23 篇 compressive sens...
  • 23 篇 linear programmi...
  • 20 篇 submodular funct...
  • 20 篇 wireless sensor ...
  • 20 篇 integer programm...

机构

  • 9 篇 univ s carolina ...
  • 8 篇 univ autonoma ma...
  • 8 篇 univ texas dalla...
  • 7 篇 univ chinese aca...
  • 6 篇 nanyang technol ...
  • 6 篇 moscow mv lomono...
  • 5 篇 brown univ div a...
  • 5 篇 yerevan state un...
  • 5 篇 univ s carolina ...
  • 5 篇 mit cambridge ma...
  • 5 篇 univ sci & techn...
  • 4 篇 univ sci & techn...
  • 4 篇 nanyang technol ...
  • 4 篇 new jersey inst ...
  • 4 篇 univ texas austi...
  • 4 篇 ohio state univ ...
  • 4 篇 univ ulm inst op...
  • 4 篇 georgia state un...
  • 4 篇 univ int busines...
  • 4 篇 rutgers state un...

作者

  • 9 篇 borowiecki piotr
  • 9 篇 qian tao
  • 8 篇 zielosko beata
  • 8 篇 wang wei
  • 8 篇 moshkov mikhail
  • 7 篇 zhang zhao
  • 7 篇 michel volker
  • 7 篇 wang yu
  • 7 篇 sawada joe
  • 7 篇 faigle u
  • 6 篇 temlyakov vn
  • 6 篇 rautenbach diete...
  • 6 篇 tang yuan yan
  • 6 篇 chen yanlai
  • 6 篇 chen peng
  • 6 篇 wu weili
  • 5 篇 saito yuji
  • 5 篇 zhang xiaoyan
  • 5 篇 zhang tong
  • 5 篇 yamada keigo

语言

  • 2,122 篇 英文
  • 123 篇 其他
  • 26 篇 中文
  • 3 篇 法文
  • 2 篇 德文
  • 1 篇 葡萄牙文
检索条件"主题词=greedy algorithm"
2278 条 记 录,以下是91-100 订阅
排序:
Object-Oriented Data Flow Diagram Similarity Measurement Using greedy algorithm  1
Object-Oriented Data Flow Diagram Similarity Measurement Usi...
收藏 引用
1st International Conference on Cybernetics and Intelligent System (ICORIS)
作者: Irhamn, Firli Siahaan, Daniel Univ Trunojoyo Dept Informat Syst Bangkalan Indonesia Inst Teknol Sepuluh Nopember Dept Informat Surabaya Indonesia
Measuring software similarity base on software design artifacts has been one of the research topics in software engineering. Software similarity measurement is used in software reuse, clone detection, and learning ass... 详细信息
来源: 评论
Parametric POD-Galerkin model order reduction with a greedy algorithm for the time-domain Maxwell's equations
Parametric POD-Galerkin model order reduction with a greedy ...
收藏 引用
International Applied-Computational-Electromagnetics-Society Symposium - China (ACES)
作者: Li, Kun Huang, Ting-Zhu Li, Liang Lanteri, Stephane Univ Elect Sci & Technol China Sch Math Sci Chengdu 611731 Peoples R China INRIA 2004 Route LuciolesBP 93 F-06902 Sophia Antipolis France
In this work we report a parametric reduced order model (ROM) based on the proper orthogonal decomposition (POD) method with Galerkin projection for solving the system of time-domain Maxwell's equations. In partic... 详细信息
来源: 评论
A Fast greedy algorithm for Finding Minimum Positive Influence Dominating Sets in Social Networks
A Fast Greedy Algorithm for Finding Minimum Positive Influen...
收藏 引用
IEEE Conference on Computer Communications (IEEE INFOCOM)
作者: Pan, Jiehui Bu, Tian-Ming East China Normal Univ Sch Comp Sci & Software Engn Shanghai Peoples R China East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China
As a variant of the dominating set problem, the positive influence dominating set problem tries to find a set such that at least half neighbors of every node in the graph are included by it. Because this problem has w... 详细信息
来源: 评论
A Modified Simulated Annealing algorithm Based on Principle of the greedy algorithm for Networks with Mobile Nodes
A Modified Simulated Annealing Algorithm Based on Principle ...
收藏 引用
International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science
作者: Yuliia Pyrih Mykola Kaidan Bohdan Strykhalyuk Viktoriia Zhebka Department of Telecommunication Lviv Polytehnic National University Lviv Ukraine Department of Radioelectronic Devices and Systems Lviv Polytehnic National University Lviv Ukraine Department of Software Engineering State University of Telecommunications Kyiv Ukraine
A modified simulated annealing algorithm is presented to improve data routing efficiency on mobile nodes, the feature of which is the use of the greedy choice principle to determine data route with the best value of t... 详细信息
来源: 评论
greedy algorithm with gaps
收藏 引用
JOURNAL OF APPROXIMATION THEORY 2018年 225卷 176-190页
作者: Oikhberg, T. Univ Illinois Dept Math Urbana IL 61801 USA
We generalize the well-known greedy approximation algorithm, by allowing gaps in the approximating sequence. We give examples of bases which are "quasi-greedy with gaps," in spite of failing to be quasi gree... 详细信息
来源: 评论
A greedy-based algorithm in Optimizing Student's Recommended Timetable Generator with Semester Planner
收藏 引用
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2022年 第1期13卷 369-375页
作者: Abu Samah, Khyrina Airin Fariza Thusree, Siti Qamalia Fadzil, Ahmad Firdaus Ahmad Riza, Lala Septem Ibrahim, Shafaf Hasan, Noraini Univ Teknol MARA Fac Comp & Math Sci Cawangan Melaka Kampus Jasin Melaka Malaysia Univ Teknol MARA Fac Comp & Math Sci Shah Alam Selangor Malaysia Univ Pendidikan Indonesia Dept Comp Sci Educ Bandung Indonesia
Semester planner plays an essential role in students' society that might help students have self-discipline and determination to complete their studies. However, during the COVID-19 pandemic, they faced difficulty... 详细信息
来源: 评论
Research on Caravan Seaborne Loading Scheme Based on greedy algorithm  19
Research on Caravan Seaborne Loading Scheme Based on Greedy ...
收藏 引用
Proceedings of the 2019 2nd International Conference on algorithms, Computing and Artificial Intelligence
作者: Peng Sun Guang Jin WanYu Wang Yin Zou Dan Li College of Systems Engineering National University of Defense Technology Changsha Hunan Province China
Seaborne loading is a commercial action that loads people and materials that need to be transported into maritime transport. The merits of this action directly affect the cost of goods. The indicators that judge the m... 详细信息
来源: 评论
greedy algorithm WITH APPROXIMATION RATIO FOR SAMPLING NOISY GRAPH SIGNALS
GREEDY ALGORITHM WITH APPROXIMATION RATIO FOR SAMPLING NOISY...
收藏 引用
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
作者: Wu, Changlong Chen, Wenxin Zhang, June Univ Hawaii Manoa Dept Elect Engn Honolulu HI 96822 USA
We study the optimal sampling set selection problem in sampling a noisy k-bandlimited graph signal. To minimize the effect of noise when trying to reconstruct a k-bandlimited graph signal from m samples, the optimal s... 详细信息
来源: 评论
A greedy algorithm for finding a large 2-matching on a random cubic graph
收藏 引用
JOURNAL OF GRAPH THEORY 2018年 第3期88卷 449-481页
作者: Bal, Deepak Bennett, Patrick Bohman, Tom Frieze, Alan Montclair State Univ Dept Math Sci Montclair NJ USA Western Michigan Univ Dept Math Kalamazoo MI 49008 USA Carnegie Mellon Univ Dept Math Sci Pittsburgh PA 15213 USA
A 2-matching of a graph G is a spanning subgraph with maximum degree two. The size of a 2-matching U is the number of edges in U and this is at least n-(U) where n is the number of vertices of G and denotes the number... 详细信息
来源: 评论
A new greedy algorithm for sparse recovery
收藏 引用
NEUROCOMPUTING 2018年 275卷 137-143页
作者: Wang, Qian Qu, Gangrong Beijing Jiaotong Univ Sch Sci Beijing 100044 Peoples R China BCMIIS Beijing 100048 Peoples R China
Compressed sensing (CS) has been one of the great successes of applied mathematics in the last decade. This paper proposes a new method, combining the advantage of the Compressive Sampling Matching Pursuit (CoSaMP) al... 详细信息
来源: 评论