咨询与建议

限定检索结果

文献类型

  • 477 篇 期刊文献
  • 144 篇 会议
  • 5 篇 学位论文
  • 2 册 图书

馆藏范围

  • 628 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 456 篇 工学
    • 361 篇 计算机科学与技术...
    • 116 篇 电气工程
    • 78 篇 软件工程
    • 42 篇 控制科学与工程
    • 40 篇 信息与通信工程
    • 8 篇 机械工程
    • 7 篇 电子科学与技术(可...
    • 4 篇 力学(可授工学、理...
    • 4 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 动力工程及工程热...
    • 3 篇 石油与天然气工程
    • 3 篇 生物医学工程(可授...
    • 3 篇 生物工程
    • 3 篇 网络空间安全
    • 2 篇 测绘科学与技术
    • 2 篇 化学工程与技术
    • 2 篇 航空宇航科学与技...
  • 305 篇 理学
    • 274 篇 数学
    • 29 篇 物理学
    • 22 篇 统计学(可授理学、...
    • 8 篇 系统科学
    • 5 篇 生物学
  • 60 篇 管理学
    • 59 篇 管理科学与工程(可...
    • 12 篇 工商管理
  • 17 篇 经济学
    • 15 篇 应用经济学
    • 2 篇 理论经济学
  • 6 篇 医学
    • 5 篇 临床医学
  • 4 篇 农学
    • 2 篇 作物学
  • 3 篇 法学
    • 3 篇 法学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 628 篇 randomized algor...
  • 31 篇 approximation al...
  • 25 篇 distributed algo...
  • 19 篇 low-rank approxi...
  • 17 篇 computational ge...
  • 15 篇 approximation
  • 14 篇 lower bound
  • 13 篇 clustering
  • 12 篇 optimization
  • 11 篇 dimension reduct...
  • 11 篇 parallel algorit...
  • 10 篇 load balancing
  • 10 篇 linear programmi...
  • 10 篇 combinatorial op...
  • 9 篇 competitive anal...
  • 9 篇 singular value d...
  • 9 篇 sketching
  • 8 篇 computational co...
  • 8 篇 big data
  • 8 篇 leader election

机构

  • 11 篇 chongqing univ c...
  • 6 篇 fudan univ sch m...
  • 6 篇 stanford univ de...
  • 5 篇 univ hong kong d...
  • 5 篇 univ colorado de...
  • 5 篇 city univ hong k...
  • 5 篇 natl univ singap...
  • 4 篇 n carolina state...
  • 4 篇 wuhan univ sch m...
  • 4 篇 max planck inst ...
  • 4 篇 tsinghua univ in...
  • 4 篇 stanford univ ic...
  • 4 篇 fudan univ key l...
  • 4 篇 purdue univ dept...
  • 4 篇 univ michigan de...
  • 3 篇 univ elect sci &...
  • 3 篇 univ chicago dep...
  • 3 篇 iit dept comp sc...
  • 3 篇 xiamen univ wang...
  • 3 篇 chongqing univ k...

作者

  • 11 篇 li hanyu
  • 9 篇 pandurangan gopa...
  • 6 篇 yang haizhao
  • 6 篇 wei yimin
  • 5 篇 robinson peter
  • 5 篇 tropp joel a.
  • 5 篇 wang mengyu
  • 5 篇 kaltofen e
  • 5 篇 alipour sharareh
  • 5 篇 gulwani s
  • 5 篇 ghodsi mohammad
  • 5 篇 wang jianxin
  • 5 篇 molla anisur rah...
  • 5 篇 lau francis c. m...
  • 5 篇 necula gc
  • 5 篇 chen jianer
  • 4 篇 sauerwald thomas
  • 4 篇 kumar manish
  • 4 篇 liu yang
  • 4 篇 mostefaoui achou...

语言

  • 586 篇 英文
  • 36 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=Randomized algorithm"
628 条 记 录,以下是361-370 订阅
排序:
Visibility testing and counting
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第9期115卷 649-654页
作者: Alipour, Sharareh Ghodsi, Mohammad Zarei, Alireza Pourreza, Maryam Sharif Univ Technol Tehran Iran Sharif Univ Technol Inst Res Fundamental Sci IPM Tehran Iran
For a set of n disjoint line segments S in R-2, the visibility testing problem (VTP) is to test whether the query point p sees a query segment s is an element of S. For this configuration, the visibility counting prob... 详细信息
来源: 评论
A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs
收藏 引用
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2015年 第5期43卷 840-875页
作者: Jelic, Slobodan Laue, Soeren Matijevic, Domagoj Wijerama, Patrick Univ Osijek Dept Math Osijek 31000 Croatia Univ Jena Fak Math & Informat Lehrstuhl Theoret Informat 2 D-07743 Jena Germany Johannes Kepler Univ Linz Inst Symbol Rechnen A-4232 Hagenberg Mhlkreis Austria
We present a parallel implementation of the randomized approximation algorithm for packing and covering linear programs presented by Koufogiannakis and Young (2007). Their approach builds on ideas of the sublinear tim... 详细信息
来源: 评论
Fast randomized algorithm for center-detection
收藏 引用
PATTERN RECOGNITION 2010年 第8期43卷 2659-2665页
作者: Chung, Kuo-Liang Huang, Yong-Huai Wang, Jyun-Pin Chang, Ting-Chin Liao, Hong-Yuan Mark Jinwen Univ Sci & Technol Inst Comp & Commun Engn Taipei 23154 Taiwan Jinwen Univ Sci & Technol Dept Elect Engn Taipei 23154 Taiwan Natl Taiwan Univ Sci & Technol Dept Comp Sci & Informat Engn Taipei 10672 Taiwan Acad Sinica Inst Informat Sci Taipei 115 Taiwan
Recently, Cauchie et al. presented an adaptive Hough transform-based algorithm to successfully solve the center-detection problem which is an important issue in many real-world problems. This paper presents a fast ran... 详细信息
来源: 评论
A New Probabilistic Robust Control Approach for System with Uncertain Parameters
收藏 引用
ASIAN JOURNAL OF CONTROL 2015年 第4期17卷 1330-1341页
作者: Xie, Rong Gong, Jianying Wang, Xinmin Northwestern Polytech Univ Sch Automat Xian 710072 Peoples R China Changan Univ Sch Elect & Control Engn Xian 710064 Peoples R China
This paper addresses the issues of conservativeness and computational complexity of robust control. A new probabilistic robust control method is proposed to design a high performance controller. The key of the new met... 详细信息
来源: 评论
Truthful unit-demand auctions with budgets revisited
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 573卷 1-15页
作者: Henzinger, Monika Loitzenbauer, Veronika Univ Vienna Fac Comp Sci A-1090 Vienna Austria
We consider auctions of indivisible items to unit-demand bidders with budgets. This setting was suggested as an expressive model for single sponsored search auctions. Prior work presented mechanisms that compute bidde... 详细信息
来源: 评论
Performance Bounds for the Scenario Approach and an Extension to a Class of Non-Convex Programs
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2015年 第1期60卷 46-58页
作者: Esfahani, Peyman Mohajerin Sutter, Tobias Lygeros, John ETH Automat Control Lab CH-8092 Zurich Switzerland
We consider the Scenario Convex Program (SCP) for two classes of optimization problems that are not tractable in general: Robust Convex Programs (RCPs) and Chance-Constrained Programs (CCPs). We establish a probabilis... 详细信息
来源: 评论
Models and algorithms for packing rectangles into the smallest square
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2015年 63卷 161-171页
作者: Martello, Silvano Monaci, Michele Univ Bologna DEI Guglielmo Marconi I-40136 Bologna Italy Univ Padua DEI I-35131 Padua Italy
We consider the problem of determining the smallest square into which a given set of rectangular items can be packed without overlapping. We present an ILP model, an exact approach based on the iterated execution of a... 详细信息
来源: 评论
A randomized Divide and Conquer algorithm for Higher-Order Abstract Voronoi Diagrams  25
A Randomized Divide and Conquer Algorithm for Higher-Order A...
收藏 引用
25th International Symposium on algorithms and Computation (ISAAC)
作者: Bohler, Cecilia Liu, Chih-Hung Papadopoulou, Evanthia Zavershynskyi, Maksym Univ Bonn Inst Comp Sci 1 D-53113 Bonn Germany USI Fac Informat Lugano Switzerland
Given a set of sites in the plane, their order-k Voronoi diagram partitions the plane into regions such that all points within one region have the same k nearest sites. The order-k abstract Voronoi diagram is defined ... 详细信息
来源: 评论
ON THE COMPLEXITY OF INVERTING INTEGER AND POLYNOMIAL MATRICES
收藏 引用
COMPUTATIONAL COMPLEXITY 2015年 第4期24卷 777-821页
作者: Storjohann, Arne Univ Waterloo David R Cheriton Sch Comp Sci Waterloo ON N2L 3G1 Canada
An algorithm is presented that probabilistically computes the exact inverse of a nonsingular n x n integer matrix A using (n(3)(log parallel to A parallel to + log kappa(A)))(1+o(1)) bit operations. Here, parallel to ... 详细信息
来源: 评论
An Improved Approximation algorithm for Knapsack Median Using Sparsification  23rd
An Improved Approximation Algorithm for Knapsack Median Usin...
收藏 引用
23rd Annual European Symposium on algorithms (ESA) as part of ALGO Conference
作者: Byrka, Jaroslaw Pensyl, Thomas Rybicki, Bartosz Spoerhase, Joachim Srinivasan, Aravind Khoa Trinh Univ Warsaw Inst Comp Sci PL-00325 Warsaw Poland Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Instute Adv Comp Studies College Pk MD 20742 USA
Knapsack median is a generalization of the classic k-median problem in which we replace the cardinality constraint with a knapsack constraint. It is currently known to be 32-approximable. We improve on the best known ... 详细信息
来源: 评论