咨询与建议

限定检索结果

文献类型

  • 972 篇 期刊文献
  • 420 篇 会议
  • 15 篇 学位论文
  • 2 册 图书

馆藏范围

  • 1,409 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,153 篇 工学
    • 879 篇 计算机科学与技术...
    • 240 篇 电气工程
    • 224 篇 控制科学与工程
    • 176 篇 软件工程
    • 51 篇 信息与通信工程
    • 22 篇 机械工程
    • 15 篇 电子科学与技术(可...
    • 12 篇 仪器科学与技术
    • 7 篇 航空宇航科学与技...
    • 3 篇 力学(可授工学、理...
    • 2 篇 材料科学与工程(可...
    • 2 篇 化学工程与技术
    • 2 篇 交通运输工程
    • 2 篇 生物工程
    • 2 篇 网络空间安全
    • 1 篇 土木工程
  • 581 篇 理学
    • 529 篇 数学
    • 64 篇 系统科学
    • 30 篇 统计学(可授理学、...
    • 15 篇 物理学
    • 7 篇 生物学
    • 1 篇 生态学
  • 109 篇 管理学
    • 108 篇 管理科学与工程(可...
    • 10 篇 工商管理
  • 18 篇 经济学
    • 16 篇 应用经济学
    • 2 篇 理论经济学
  • 5 篇 医学
    • 4 篇 临床医学
    • 2 篇 基础医学(可授医学...
  • 4 篇 法学
    • 4 篇 法学
  • 4 篇 农学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 1,409 篇 randomized algor...
  • 114 篇 approximation al...
  • 69 篇 algorithms
  • 53 篇 online algorithm...
  • 48 篇 parallel algorit...
  • 44 篇 competitive anal...
  • 43 篇 distributed algo...
  • 35 篇 distributed comp...
  • 33 篇 computational co...
  • 31 篇 optimization
  • 29 篇 property testing
  • 27 篇 graph algorithms
  • 23 篇 probabilistic ro...
  • 21 篇 load balancing
  • 21 篇 analysis of algo...
  • 21 篇 computational ge...
  • 21 篇 consensus
  • 21 篇 convex optimizat...
  • 20 篇 robust control
  • 20 篇 deterministic al...

机构

  • 15 篇 politecn torino ...
  • 15 篇 technion israel ...
  • 13 篇 politecn torino ...
  • 12 篇 univ maryland de...
  • 11 篇 rensselaer polyt...
  • 11 篇 max planck inst ...
  • 10 篇 politecn milan d...
  • 10 篇 univ calif berke...
  • 9 篇 fudan univ sch m...
  • 9 篇 univ maryland in...
  • 9 篇 tel aviv univ sc...
  • 8 篇 cornell univ dep...
  • 8 篇 mit cambridge ma...
  • 8 篇 univ maryland co...
  • 8 篇 univ waterloo sc...
  • 8 篇 yale univ dept c...
  • 8 篇 fudan univ key l...
  • 8 篇 politecn torino ...
  • 7 篇 tel aviv univ sc...
  • 7 篇 univ connecticut...

作者

  • 15 篇 srinivasan aravi...
  • 15 篇 dabbene fabrizio
  • 15 篇 tempo roberto
  • 11 篇 patt-shamir boaz
  • 11 篇 drineas petros
  • 10 篇 rajasekaran s
  • 10 篇 wei yimin
  • 9 篇 calafiore giusep...
  • 9 篇 xu pan
  • 9 篇 mahoney michael ...
  • 9 篇 saibaba arvind k...
  • 8 篇 chan timothy m.
  • 8 篇 prandini maria
  • 8 篇 woelfel philipp
  • 8 篇 alistarh dan
  • 8 篇 piroddi luigi
  • 8 篇 doerr benjamin
  • 7 篇 chen zhi-zhong
  • 7 篇 rajasekaran sang...
  • 7 篇 tempo r

语言

  • 1,347 篇 英文
  • 57 篇 其他
  • 4 篇 中文
  • 1 篇 西班牙文
检索条件"主题词=Randomized Algorithms"
1409 条 记 录,以下是401-410 订阅
排序:
Near-Optimal Rapid MPC Using Neural Networks: A Primal-Dual Policy Learning Framework
收藏 引用
IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2021年 第5期29卷 2102-2114页
作者: Zhang, Xiaojing Bujarbaruah, Monimoy Borrelli, Francesco Univ Calif Berkeley Model Predict Control Lab Berkeley CA 94720 USA
In this article, we propose a novel framework for approximating the MPC policy for linear parameter-varying systems using supervised learning. Our learning scheme guarantees feasibility and near-optimality of the appr... 详细信息
来源: 评论
Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
收藏 引用
AUTOMATICA 2007年 第3期43卷 538-545页
作者: Oishi, Yasuaki Univ Tokyo Grad Sch Informat Sci & Technol Dept Math Informat Bunkyo Ku Tokyo 1138656 Japan
A randomized approach is considered for a feasibility problem on a parameter-dependent linear matrix inequality (LMI). In particular, a gradient-based and an ellipsoid-based randomized algorithms are improved by intro... 详细信息
来源: 评论
A new approximation algorithm for the multilevel facility location problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第5期158卷 453-460页
作者: Gabor, Adriana F. van Ommeren, Jan-Kees C. W. Erasmus Univ Inst Econometr NL-3000 DR Rotterdam Netherlands Univ Twente Fac Elect Engn Math & Comp Sci NL-7500 AE Enschede Netherlands
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP-rounding. The linear program that we use has a polynomial n... 详细信息
来源: 评论
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
收藏 引用
ALGORITHMICA 2020年 第1期82卷 64-87页
作者: Brubach, Brian Sankararaman, Karthik A. Srinivasan, Aravind Xu, Pan Univ Maryland College Pk MD 20742 USA New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA
Online matching problems have garnered significant attention in recent years due to numerous applications in e-commerce, online advertisements, ride-sharing, etc. Many of them capture the uncertainty in the real world... 详细信息
来源: 评论
Quasi-fully dynamic algorithms for two-connectivity and cycle equivalence
收藏 引用
ALGORITHMICA 2002年 第2期33卷 168-182页
作者: Korupolu, MR Ramachandran, V Univ Texas Dept Comp Sci Austin TX 78712 USA
We introduce a new class of dynamic graph algorithms called quasi-fully dynamic algorithms, which are much more general than backtracking algorithms and are much simpler than fully dynamic algorithms. These algorithms... 详细信息
来源: 评论
A novel randomised particle swarm optimizer
收藏 引用
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS 2021年 第2期12卷 529-540页
作者: Liu, Weibo Wang, Zidong Zeng, Nianyin Yuan, Yuan Alsaadi, Fuad E. Liu, Xiaohui Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao 266590 Peoples R China Brunel Univ London Dept Comp Sci Uxbridge UB8 3PH Middx England Xiamen Univ Dept Instrumental & Elect Engn Xiamen 361005 Fujian Peoples R China Northwestern Polytech Univ Sch Astronaut Xian 710072 Peoples R China King Abdulaziz Univ Fac Engn Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia
The particle swarm optimization (PSO) algorithm is a popular evolutionary computation approach that has received an ever-increasing interest in the past decade owing to its wide application potential. Despite the many... 详细信息
来源: 评论
Testing membership in languages that have small width branching programs
收藏 引用
SIAM JOURNAL ON COMPUTING 2002年 第5期31卷 1557-1570页
作者: Newman, I Univ Haifa Dept Comp Sci IL-31905 Haifa Israel
Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [ J. ACM, 45 (1998), pp. 653-750] and inspired by Rubinfeld and Sudan [SIAM J. Comput., 25 (1996), pp. 252-271], deals with the f... 详细信息
来源: 评论
On the Nystrom method for approximating a gram matrix for improved kernel-based learning
收藏 引用
JOURNAL OF MACHINE LEARNING RESEARCH 2005年 第12期6卷 2153-2175页
作者: Drineas, P Mahoney, MW Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA Yale Univ Dept Math New Haven CT 06520 USA
A problem for many kernel-based methods is that the amount of computation required to find the solution scales as O(n(3)), where n is the number of training examples. We develop and analyze an algorithm to compute an ... 详细信息
来源: 评论
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
收藏 引用
NETWORKS 2024年 第3期83卷 587-604页
作者: Mathwieser, Corinna Cela, Eranda Rhein Westfal TH Aachen Lehr & Forschungsgebiet Kombinator Optimierung D-52062 Aachen Germany Graz Univ Technol Dept Discrete Math Graz Austria
This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special instance types, including cactus gra... 详细信息
来源: 评论
Implementation of the simultaneous perturbation algorithm for stochastic optimization
收藏 引用
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1998年 第3期34卷 817-823页
作者: Spall, JC Johns Hopkins Univ Appl Phys Lab Laurel MD 20723 USA
The need for solving multivariate optimization problems is pervasive in engineering and the physical and social sciences. The simultaneous perturbation stochastic approximation (SPSA) algorithm has recently attracted ... 详细信息
来源: 评论