咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 1,410 篇 randomized algor...
  • 115 篇 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,348 篇 英文
  • 57 篇 其他
  • 4 篇 中文
  • 1 篇 西班牙文
检索条件"主题词=Randomized Algorithms"
1410 条 记 录,以下是431-440 订阅
排序:
Constraint-Tightening and Stability in Stochastic Model Predictive Control
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2017年 第7期62卷 3165-3177页
作者: Lorenzen, Matthias Dabbene, Fabrizio Tempo, Roberto Allgoewer, Frank Univ Stuttgart Inst Syst Theory & Automat Control Stuttgart Germany CNR IEIIT Politecn Torino Rome Italy
Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highligh... 详细信息
来源: 评论
GREEDY algorithms FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE algorithms AND INAPPROXIMABILITY BOUNDS
收藏 引用
SIAM JOURNAL ON COMPUTING 2017年 第3期46卷 1029-1061页
作者: Poloczek, Matthias Schnitger, Georg Williamson, David P. Van Zuylen, Anke Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14853 USA Goethe Univ Frankfurt Main Inst Comp Sci Frankfurt Germany Coll William & Mary Dept Math Williamsburg VA 23185 USA
We give a simple, randomized greedy algorithm for the maximum satisfiability problem (MAX SAT) that obtains a 3/4-approximation in expectation. In contrast to previously known 3/4-approximation algorithms, our algorit... 详细信息
来源: 评论
OPTIMAL CUR MATRIX DECOMPOSITIONS
收藏 引用
SIAM JOURNAL ON COMPUTING 2017年 第2期46卷 543-589页
作者: Boutsidis, Christos Woodruff, David P. Yahoo Labs New York NY 10018 USA IBM Res Almaden CA 94040 USA
The CUR decomposition of an m x n matrix A finds an m x c matrix C with a subset of c < n columns of A, together with an r x n matrix R with a subset of r < m rows of A, as well as a c x r low-rank matrix U such... 详细信息
来源: 评论
Multi-aircraft Conflict Detection and Resolution Based on Probabilistic Reach Sets
收藏 引用
IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2017年 第1期25卷 309-316页
作者: Yang, Yang Zhang, Jun Cai, Kai-Quan Prandini, Maria Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy
In this brief, a novel scheme to multi-aircraft conflict detection and resolution is introduced. A key feature of the proposed scheme is that uncertainty affecting the aircraft future positions along some look-ahead p... 详细信息
来源: 评论
RANDOMIZATION HELPS COMPUTING A MINIMUM SPANNING TREE UNDER UNCERTAINTY
收藏 引用
SIAM JOURNAL ON COMPUTING 2017年 第4期46卷 1217-1240页
作者: Megow, Nicole Meissner, Julie Skutella, Martin Univ Bremen Dept Math & Comp Sci Bremen Germany Tech Univ Berlin Dept Math Berlin Germany
Given a graph with "uncertainty intervals" on the edges, we want to identify a minimum spanning tree by querying some edges for their exact edge weights which lie in the given uncertainty intervals. Our obje... 详细信息
来源: 评论
Rural postman parameterized by the number of components of required edges
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2017年 第1期83卷 121-131页
作者: Gutin, Gregory Wahlstrom, Magnus Yeo, Anders Royal Holloway Univ London Dept Comp Sci Egham TW20 0EX Surrey England Univ Southern Denmark Dept Math & Comp Sci Campusvej 55 DK-5230 Odense M Denmark Univ Johannesburg Dept Math ZA-2006 Auckland Pk South Africa
In the Directed Rural Postman Problem (DRPP), given a strongly connected directed multigraph D = (V, A) with nonnegative integral weights on the arcs, a subset R of required arcs and a nonnegative integer l, decide wh... 详细信息
来源: 评论
Greedy Matching: Guarantees and Limitations
收藏 引用
ALGORITHMICA 2017年 第1期77卷 201-234页
作者: Besser, Bert Poloczek, Matthias Goethe Univ Frankfurt Main Inst Informat Frankfurt Germany Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14850 USA
Since Tinhofer proposed the MINGREEDY algorithm for maximum cardinality matching in 1984, several experimental studies found the randomized algorithm to perform excellently for various classes of random graphs and ben... 详细信息
来源: 评论
Relaxed leverage sampling for low-rank matrix completion
收藏 引用
INFORMATION PROCESSING LETTERS 2017年 第Aug.期124卷 6-9页
作者: Kundu, Abhisek Intel Parallel Comp Labs Bangalore Karnataka India
We show that any m x n matrix of rank rho can be recovered exactly via nuclear norm minimization from circle minus (lambda . log(2)(m + n)) randomly sampled entries (lambda = (m + n)rho - rho(2) being the degrees of f... 详细信息
来源: 评论
Distributed algorithms for the Lovasz local lemma and graph coloring
收藏 引用
DISTRIBUTED COMPUTING 2017年 第4期30卷 261-280页
作者: Chung, Kai-Min Pettie, Seth Su, Hsin-Hao Acad Sinica Taipei Taiwan Univ Michigan Ann Arbor MI 48109 USA MIT 77 Massachusetts Ave Cambridge MA 02139 USA
The Lovasz local lemma (LLL), introduced by Erdos and Lovasz in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n "bad" events do not happen with non-zero probabil... 详细信息
来源: 评论
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2017年 第7期63卷 4709-4724页
作者: Braun, Gabor Guzman, Cristobal Pokutta, Sebastian Georgia Inst Technol Dept Ind & Syst Engn Atlanta GA 30332 USA Pontificia Univ Catolica Chile Fac Matemat Santiago 7820436 Chile Pontificia Univ Catolica Chile Escuela Ingn Santiago 7820436 Chile
We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely ... 详细信息
来源: 评论