咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 3,344 篇 greedy algorithm...
  • 355 篇 approximation al...
  • 319 篇 optimization
  • 318 篇 algorithm design...
  • 289 篇 heuristic algori...
  • 216 篇 computer science
  • 200 篇 resource managem...
  • 178 篇 computational mo...
  • 174 篇 costs
  • 154 篇 routing
  • 148 篇 genetic algorith...
  • 131 篇 linear programmi...
  • 116 篇 clustering algor...
  • 110 篇 wireless sensor ...
  • 103 篇 computational co...
  • 103 篇 matching pursuit...
  • 99 篇 compressed sensi...
  • 97 篇 bandwidth
  • 96 篇 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,289 篇 英文
  • 38 篇 其他
  • 14 篇 中文
  • 2 篇 俄文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=greedy Algorithms"
3344 条 记 录,以下是21-30 订阅
排序:
Analysis of Target Data-Dependent greedy Kernel algorithms: Convergence Rates for f-, f . P- and f/P-greedy
收藏 引用
CONSTRUCTIVE APPROXIMATION 2023年 第1期57卷 45-74页
作者: Wenzel, Tizian Santin, Gabriele Haasdonk, Bernard Univ Stuttgart Inst Appl Anal & Numer Simulat Stuttgart Germany Bruno Kessler Fdn Digital Soc Ctr Trento Italy
Data-dependent greedy algorithms in kernel spaces are known to provide fast converging interpolants, while being extremely easy to implement and efficient to run. Despite this experimental evidence, no detailed theory... 详细信息
来源: 评论
A Family of Fast Parallel greedy algorithms for the Steiner Forest Problem
A Family of Fast Parallel Greedy Algorithms for the Steiner ...
收藏 引用
IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)
作者: Laleh Ghalami Daniel Grosu Department of Computer Science Wayne State University Detroit USA
We introduce a family of fast parallel greedy algorithms for the Steiner Forest Problem, a fundamental combinatorial optimization problem in graphs. Given an undirected graph with non-negative weights for edges and a ... 详细信息
来源: 评论
Online Learning via Offline greedy algorithms: Applications in Market Design and Optimization  21
Online Learning via Offline Greedy Algorithms: Applications ...
收藏 引用
Proceedings of the 22nd ACM Conference on Economics and Computation
作者: Rad Niazadeh Negin Golrezaei Joshua R. Wang Fransisca Susan Ashwinkumar Badanidiyuru The University of Chicago Chicago IL USA Massachusetts Institute of Technology Cambridge MA USA Google Research Mountain View CA USA
Motivated by online decision-making in time-varying combinatorial environments, we study the problem of transforming offline algorithms to their online counterparts. We focus on offline combinatorial problems that are... 详细信息
来源: 评论
Non-Negative Orthogonal greedy algorithms
收藏 引用
IEEE TRANSACTIONS ON SIGNAL PROCESSING 2019年 第21期67卷 5643-5658页
作者: Thanh Thi Nguyen Idier, Jerome Soussen, Charles Djermoune, El-Hadi Univ Lorraine F-54506 Vandceuvre Les Nancy France CNRS Ctr Rech Automat Nancy F-54506 Vandceuvre Les Nancy France CNRS Lab Sci Numer Nantes F-44321 Nantes France Univ Paris Saclay Univ Paris Sud CNRS Cent SupelecLab Signaux & Syst F-91192 Gif Sur Yvette France
Orthogonal greedy algorithms are popular sparse signal reconstruction algorithms. Their principle is to select atoms one by one. A series of unconstrained least-square subproblems of gradually increasing size is solve... 详细信息
来源: 评论
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... 详细信息
来源: 评论
The statistical properties analysis of reconstruction error in greedy pursuit algorithms: Taking OMP as an example
收藏 引用
ELECTRONICS LETTERS 2023年 第22期59卷 e13023-e13023页
作者: Xiao, Lei Han, Yubing Ma, Xiaofeng Dai, Minghui Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing Jiangsu Peoples R China
greedy pursuit algorithms are widely used in sparse signal processing for their computational efficiency. However, research on the reconstruction error properties is far from comprehensive. This paper derives the stat... 详细信息
来源: 评论
greedy training algorithms for neural networks and applications to PDEs
收藏 引用
JOURNAL OF COMPUTATIONAL PHYSICS 2023年 第1期484卷
作者: Siegel, Jonathan W. Hong, Qingguo Jin, Xianlin Hao, Wenrui Xu, Jinchao Penn State Univ Dept Math University Pk PA 16802 USA Peking Univ Sch Math Sci Beijing Peoples R China
Recently, neural networks have been widely applied for solving partial differential equations (PDEs). Although such methods have been proven remarkably successful on practical engineering problems, they have not been ... 详细信息
来源: 评论
Hybrid optimisation method of sparse FIR DFEs based on reweighted l1-norm minimisation and greedy algorithms
收藏 引用
ELECTRONICS LETTERS 2019年 第8期55卷 491-492页
作者: Yu, Lihong Zhao, Jiaxiang Nankai Univ Coll Artificial Intelligence Tianjin 300350 Peoples R China Nankai Univ Coll Elect Informat & Opt Engn Tianjin 300350 Peoples R China
The finite-impulse-response (FIR) decision feedback equalisers (DFEs) with a large number of taps are used to eliminate the intersymbol interference. In this Letter, a hybrid optimisation approach based on reweighted ... 详细信息
来源: 评论
Duality Gap Estimates for Weak Chebyshev greedy algorithms in Banach Spaces
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2019年 第6期59卷 904-914页
作者: Mironov, S. V. Sidorov, S. P. Saratov NG Chernyshevskii State Univ Saratov 410012 Russia
The paper studies weak greedy algorithms for finding sparse solutions of convex optimization problems in Banach spaces. We consider the concept of duality gap, the values of which are implicitly calculated at the step... 详细信息
来源: 评论
Multi-AGV Motion Planning Using greedy Search algorithms and Learned Heuristics
Multi-AGV Motion Planning Using Greedy Search Algorithms and...
收藏 引用
IEEE/ASME (AIM) International Conference on Advanced Intelligent Mechatronics
作者: Sohta Kawawaki Ayumu Goto Kosuke Taneda Takeshi Muranaka Yuji Enoki Toyokazu Kobayashi Tomoya Hattori Ryota Takamido Jun Ota Department of Precision Engineering School of Engineering The University of Tokyo Tokyo Japan Logistics & Automation Division Murata Machinery Ltd. Kyoto Japan Research into Artifacts Center for Engineering (RACE) School of Engineering The University of Tokyo Tokyo Japan
For productive operations involving multiple Automated Guided Vehicles (AGVs), it is essential to plan motions quickly that minimize the total sum of costs required for each AGV to perform transport tasks (Sum-of-Cost... 详细信息
来源: 评论