咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是201-210 订阅
排序:
Comparison of Dynamic Programming and greedy algorithms and the Way to Solve 0-1 Knapsack Problem
Comparison of Dynamic Programming and Greedy Algorithms and ...
收藏 引用
作者: Yitian Wu School of Computer Science South-Central Minzu University
The 0-1 knapsack problem is widely used in reality and it belongs to NP-hard *** from the basic ideas and time complexity of the algorithm,this paper analyzes how to choose a strategy to solve the *** paper aims to so... 详细信息
来源: 评论
greedy and Adaptive algorithms for Multi-Depot Vehicle Routing with Object Alternation
收藏 引用
AUTOMATION AND REMOTE CONTROL 2023年 第3期84卷 305-325页
作者: Medvedev, S. N. Voronezh State Univ Voronezh Russia
This paper considers the multi-depot vehicle routing problem with object alternation. We propose a formal statement of the problem with two types of objects and a mathematical model with two blocks of Boolean variable... 详细信息
来源: 评论
greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第1期45卷 1-16页
作者: Shi, Majun Yang, Zishen Wang, Wei Xi An Jiao Tong Univ Sch Math & Stat 28 Xianning West Rd Xian 710049 Peoples R China
Minimum Submodular Cost Submodular Cover problem (MIN-SCSC) often occurs naturally in the areas of combinatorial optimization and particularly machine learning. It is well-known that the greedy algorithm proposed by W... 详细信息
来源: 评论
A greedy Galerkin method to efficiently select sensors for linear dynamical systems
收藏 引用
LINEAR ALGEBRA AND ITS APPLICATIONS 2023年 679卷 275-304页
作者: Kouri, Drew P. Hua, Zuhao Udell, Madeleine Sandia Natl Labs Optimizat & Uncertainty Quantificat Albuquerque NM 87185 USA Cornell Univ Phys Ithaca NY 14850 USA Stanford Univ Management Sci & Engn Stanford CA 94305 USA
A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dy-namical system and develop an... 详细信息
来源: 评论
Real-Time Prediction for Future Profile of Car Travel Based on Statistical Data and greedy algorithm
收藏 引用
SICE Journal of Control, Measurement, and System Integration 2015年 第1期8卷 7-14页
作者: Takuma Yamaguchi Akihiko Kawashima Akira Ito Shinkichi Inagaki Tatsuya Suzuki Nagoya University Nagoya UniversityDENSO CORPORATION Nagoya UniversityJST CREST
Electric Vehicles (EVs) and Plug-in Hybrid Vehicles (PHVs) are expected to be used as power-storage devices in Home Energy Management Systems (HEMSs) due to their high capacity batteries. When planning the charge and ... 详细信息
来源: 评论
greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2023年 第2期196卷 516-543页
作者: Shi, Majun Yang, Zishen Wang, Wei Xi An Jiao Tong Univ Sch Math & Stat 28 Xianning West Rd Xian 710049 Peoples R China
We study the problems of maximizing a monotone non-submodular function subject to two types of constraints, either an independent system constraint or ap-matroidconstraint. These problems often occur in the context of... 详细信息
来源: 评论
Analysis and comparison of two classical greedy algorithms for minimum spanning tree
Analysis and comparison of two classical greedy algorithms f...
收藏 引用
作者: Xinyi Yu Hebei University of technology
The total weight of the minimum spanning is the smallest in the connected *** can be used to solve many practical problems in urban ***'s algorithm and Kruskal's algorithm are greedy algorithms for solving the... 详细信息
来源: 评论
Adaptive greedy algorithms based on parameter-domain decomposition and reconstruction for the reduced basis method
收藏 引用
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING 2020年 第23期121卷 5426-5445页
作者: Jiang, Jiahua Chen, Yanlai Virginia Tech Univ Dept Math Blacksburg VA USA Univ Massachusetts Dept Math Dartmouth MA 02747 USA
The reduced basis method (RBM) empowers repeated and rapid evaluation of parametrized partial differential equations through an offline-online decomposition, a.k.a. a learning-execution process. A key feature of the m... 详细信息
来源: 评论
A Landmark Selection Method for L-Isomap Based on greedy algorithm and its Application
A Landmark Selection Method for L-Isomap Based on Greedy Alg...
收藏 引用
IEEE Annual Conference on Decision and Control
作者: Hao Shi Baoqun Yin Xiaofeng Zhang Yu Kang Yingke Lei Department of Automation University of Science and Technology of China 230027 Hefei China Electronic Engineering Institute 230027 Hefei China
Isometric feature mapping (Isomap) is a widely-used nonlinear dimensionality reduction method, but it suffers from high computational complexity. L-Isomap is a variant of Isomap which is faster than Isomap. In this al... 详细信息
来源: 评论
Rank-Based greedy Model Averaging for High-Dimensional Survival Data
收藏 引用
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION 2023年 第544期118卷 2658-2670页
作者: He, Baihua Ma, Shuangge Zhang, Xinyu Zhu, Li-Xing Univ Sci & Technol China Sch Management Int Inst Finance Hefei Peoples R China Yale Univ Dept Biostat New Haven CT USA Chinese Acad Sci Acad Math & Syst Sci Beijing Peoples R China Beijing Normal Univ Zhuhai Ctr Stat & Data Sci Zhuhai Peoples R China Hong Kong Baptist Univ Dept Math Kowloon Tong Hong Kong Peoples R China
Model averaging is an effective way to enhance prediction accuracy. However, most previous works focus on low-dimensional settings with completely observed responses. To attain an accurate prediction for the risk effe... 详细信息
来源: 评论