咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 1,413 篇 randomized algor...
  • 115 篇 approximation al...
  • 69 篇 algorithms
  • 53 篇 online algorithm...
  • 48 篇 parallel algorit...
  • 44 篇 competitive anal...
  • 43 篇 distributed algo...
  • 34 篇 distributed comp...
  • 32 篇 computational co...
  • 31 篇 optimization
  • 28 篇 property testing
  • 27 篇 graph algorithms
  • 23 篇 probabilistic ro...
  • 22 篇 convex optimizat...
  • 21 篇 load balancing
  • 21 篇 analysis of algo...
  • 21 篇 computational ge...
  • 21 篇 consensus
  • 21 篇 deterministic al...
  • 20 篇 lower bounds

机构

  • 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,352 篇 英文
  • 56 篇 其他
  • 4 篇 中文
  • 1 篇 西班牙文
检索条件"主题词=randomized algorithms"
1413 条 记 录,以下是81-90 订阅
排序:
Robust tuning of Twin-in-the-Loop vehicle dynamics controls via randomized optimization  22
Robust tuning of Twin-in-the-Loop vehicle dynamics controls ...
收藏 引用
22nd World Congress of the International Federation of Automatic Control (IFAC)
作者: Dettu, Federico Formentin, Simone Savaresi, Sergio Matteo Politecn Milan Dipartimento Elettron Informaz & Bioingn Pzza L da Vinci 32 I-20133 Milan Italy
The Twin-in-the-Loop (TiL) framework for vehicle dynamics control has been recently introduced with the goal of simplifying the end-of-line-tuning phase and enhancing the controller performance. In TiL schemes, high-f... 详细信息
来源: 评论
Optimal Prediction Using Expert Advice and randomized Littlestone Dimension  36
Optimal Prediction Using Expert Advice and Randomized Little...
收藏 引用
36th Annual Conference on Learning Theory (COLT)
作者: Filmus, Yuval Hanneke, Steve Mehalel, Idan Moran, Shay Technion Henry & Marilyn Taub Fac Comp Sci Haifa Israel Purdue Univ Dept Comp Sci W Lafayette IN USA Technion Fac Math Haifa Israel Google Res Jerusalem Israel
A classical result in online learning characterizes the optimal mistake bound achievable by deterministic learners using the Littlestone dimension (Littlestone '88). We prove an analogous result for randomized lea... 详细信息
来源: 评论
Sampling methods for multi-stage robust optimization problems
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2025年 第3期347卷 1385-1423页
作者: Maggioni, Francesca Dabbene, Fabrizio Pflug, Georg Ch. Univ Bergamo Dept Management Informat & Prod Engn Viale G Marconi 5 I-24044 Dalmine Italy Politecn Torino CNR IEIIT Cso Duca Abruzzi N 24 I-10129 Turin Italy Univ Vienna Dept Stat & Operat Res Schloss pl 1 A-2361 Laxenburg Austria Int Inst Appl Syst Anal IIASA Schloss Pl 1 A-2361 Laxenburg Austria
In this paper, we consider multi-stage robust optimization problems of the minimax type. We assume that the total uncertainty set is the cartesian product of stagewise compact uncertainty sets and approximate the give... 详细信息
来源: 评论
COMPONENT-BY-COMPONENT CONSTRUCTION OF randomized RANK-1 LATTICE RULES ACHIEVING ALMOST THE OPTIMAL randomized ERROR RATE
收藏 引用
MATHEMATICS OF COMPUTATION 2022年 第338期91卷 2771-2801页
作者: Dick, Josef Goda, Takashi Suzuki, Kosuke UNSW Sydney Sch Math & Stat Sydney NSW Australia Univ Tokyo Sch Engn 7-3-1 HongoBunkyo Ku Tokyo 1138656 Japan Hiroshima Univ Grad Sch Adv Sci & Engn I-3-1 Kagamiyama Higashihiroshima Hiroshima 7398526 Japan
We study a randomized quadrature algorithm to approximate the integral of periodic functions defined over the high-dimensional unit cube. Recent work by Kritzer, Kuo, Nuyens and Ullrich [J. Approx. Theory 240 (2019), ... 详细信息
来源: 评论
PPSZ for General k-SAT and CSP-Making Hertli's Analysis Simpler and 3-SAT Faster
收藏 引用
COMPUTATIONAL COMPLEXITY 2024年 第2期33卷 1-48页
作者: Scheder, Dominik Steinberger, John TU Chemnitz Chemnitz Germany Auki Labs Kowloon Bay Hong Kong Peoples R China
The currently fastest known algorithm for k-SAT is PPSZ, named after its inventors (Paturi et al. in J ACM 52(3):337-364, 2005. http://***/10.1145/1066100.1066101). Analyzing its running time is much easier for input ... 详细信息
来源: 评论
Finite-Sample Identification of Linear Regression Models With Residual-Permuted Sums
收藏 引用
IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1523-1528页
作者: Szentpeteri, Szabolcs Csaji, Balazs Csanad Hungarian Res Network HUN REN Inst Comp Sci & Control SZTAK H-1111 Budapest Hungary Eotvos Lorand Univ Dept Probabil Theory & Stat H-1053 Budapest Hungary
This letter studies a distribution-free, finite-sample data perturbation (DP) method, the Residual-Permuted Sums (RPS), which is an alternative of the Sign-Perturbed Sums (SPS) algorithm, to construct confidence regio... 详细信息
来源: 评论
Fast algorithms for Minimum Homology Basis
收藏 引用
DISCRETE & COMPUTATIONAL GEOMETRY 2025年 第1期74卷 49-77页
作者: Dhar, Amritendu Natarajan, Vijay Rathod, Abhishek Indian Inst Sci Dept Comp Sci & Automat Bengaluru 560012 Karnataka India Ben Gurion Univ Negev Dept Comp Sci IL-8410501 Beer Sheva Israel
We study the problem of finding a minimum homology basis, that is, a lightest set of cycles that generates the 1-dimensional homology classes with Z(2) coefficients in a given simplicial complex K. This problem has be... 详细信息
来源: 评论
Opinion Optimization for Two Different Social Objectives: Combinatorial algorithms and Linear Program Rounding
收藏 引用
Journal of Information Science and Engineering 2024年 第2期40卷 217-230页
作者: Chen, Po-An Chen, Yi-Le Lo, Wei Institute of Information Management National Yang Ming Chiao Tung University Hsinchu City300 Taiwan
In this paper, we aim to optimize the two different social objectives of opinion optimization at equilibrium by controlling some individuals. This is usually called "Stackelberg games", in which a centralize... 详细信息
来源: 评论
Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals
收藏 引用
ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION 2024年 第2期12卷 1-28页
作者: Dickerson, John P. Sankararaman, Karthik A. Srinivasan, Aravind Xu, Pan Xu, Yifan Univ Maryland Coll Pk Brendan Iribe Ctr Comp Sci & Engn 8123 Paint Branch Dr College Pk MD 20742 USA Meta 1 Hacker Way Menlo Pk CA 94025 USA New Jersey Inst Technol 323 Dr Martin Luther King Jr Blvd Newark NJ 07102 USA Southeast Univ 2 Sipailou Nanjing 210096 Peoples R China
Efficient allocation of tasks to workers is a central problem in crowdsourcing. In this article, we consider a setting inspired by spatial crowdsourcing platforms, where both workers and tasks arrive at different time... 详细信息
来源: 评论
Ensemble Kalman inversion for image guided guide wire navigation in vascular systems
收藏 引用
JOURNAL OF MATHEMATICS IN INDUSTRY 2024年 第1期14卷 21页
作者: Hanu, Matei Hesser, Juergen Kanschat, Guido Moviglia, Javier Schillings, Claudia Stallkamp, Jan FU Berlin Berlin Germany Heidelberg Univ Mannheim Inst Intelligent Syst Med Mannheim Germany Heidelberg Univ Interdisciplinary Ctr Sci Comp Heidelberg Germany
This paper addresses the challenging task of guide wire navigation in cardiovascular interventions, focusing on the parameter estimation of a guide wire system using Ensemble Kalman Inversion (EKI) with a subsampling ... 详细信息
来源: 评论