咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 627 篇 电子文献
  • 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 篇 军事学

主题

  • 627 篇 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...

语言

  • 585 篇 英文
  • 36 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=randomized algorithm"
627 条 记 录,以下是331-340 订阅
排序:
Large-Scale Log-Determinant Computation via Weighted L2 Polynomial Approximation with Prior Distribution of Eigenvalues  1
收藏 引用
3rd International Conference on High-Performance Computing and Applications (HPCA)
作者: Peng, Wei Wang, Hongxia Natl Univ Def Technol Coll Sci Sanyi Ave Changsha 410073 Hunan Peoples R China
Since the classic determinant computation method Cholesky decomposition may devastate sparsity of matrices and cost cubic steps, it is impractical to apply this method to large-scale symmetric positive-definite matric... 详细信息
来源: 评论
A Probabilistic Robust Control Method for a Small UAV with Bounded Uncertainty  35
A Probabilistic Robust Control Method for a Small UAV with B...
收藏 引用
第35届中国控制会议
作者: XIE Rong WANG Xinmin WANG Jian CAO Yuyan LI Ting School of Automation Northwestern Polytechnical University
This paper proposes a probabilistic robust control approach for a small unmanned aerial vehicle(UAV) in longitudinal ight. In the proposed method, the stochastic behavior of uncertainty parameters is considered in sol... 详细信息
来源: 评论
An Improved Constant-Factor Approximation algorithm for Planar Visibility Counting Problem  22nd
An Improved Constant-Factor Approximation Algorithm for Plan...
收藏 引用
22nd International Computing and Combinatorics Conference (COCOON)
作者: Alipour, Sharareh Ghodsi, Mohammad Jafari, Amir Sharif Univ Technol Tehran Iran Inst Res Fundamental Sci IPM Tehran Iran
Given a set S of n disjoint line segments in R-2, the visibility counting problem (VCP) is to preprocess S such that the number of segments in S visible from any query point p can be computed quickly. This problem can... 详细信息
来源: 评论
Retrieving Routes of Interest Over Road Networks  17th
Retrieving Routes of Interest Over Road Networks
收藏 引用
17th International Conference on Web-Age Information Management (WAIM)
作者: Li, Wengen Cao, Jiannong Guan, Jihong Yiu, Man Lung Zhou, Shuigeng Hong Kong Polytech Univ Hong Kong Hong Kong Peoples R China Tongji Univ Shanghai Peoples R China Fudan Univ Shanghai Peoples R China
In this paper, we propose route of interest (ROI) query which allows users to specify their interests with query keywords and returns a route such that (i) its distance is less than a distance threshold and (ii) its r... 详细信息
来源: 评论
The linear voting model  43
The linear voting model
收藏 引用
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
作者: Cooper, Colin Rivera, Nicolas Department of Informatics King's College London London United Kingdom
We study voting models on graphs. In the beginning, the vertices of a given graph have some initial opinion. Over time, the opinions on the vertices change by interactions between graph neighbours. Under suitable cond... 详细信息
来源: 评论
Mit :: Lcs :: Tr :: Mit-Lcs-Tr-651
收藏 引用
2016年
Mit :: Lcs :: Tr :: Mit-Lcs-Tr-651 by published by
来源: 评论
randomized oblivious integral routing for minimizing power cost
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第Part2期607卷 221-246页
作者: Shi, Yangguang Zhang, Fa Wu, Jie Liu, Zhiyong Chinese Acad Sci Inst Comp Technol Beijing Key Lab Mobile Comp & Pervas Device Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Chinese Acad Sci Inst Comp Technol Key Lab Intelligent Informat Proc Beijing Peoples R China Temple Univ Coll Sci & Technol Dept Comp & Informat Sci Philadelphia PA 19122 USA Chinese Acad Sci Inst Comp Technol State Key Lab Comp Architecture Beijing Peoples R China
Given an undirected network G(V, E) and a set of traffic requests R, the minimum power-cost routing problem requires that each R-k is an element of R, be routed along a single path to minimize Sigma(e is an element of... 详细信息
来源: 评论
Energy-Efficient randomized Switching for Maximizing Lifetime in Tree-Based Wireless Sensor Networks
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2015年 第5期23卷 1401-1415页
作者: Imon, Sk Kajal Arefin Khan, Adnan Di Francesco, Mario Das, Sajal K. Univ Texas Arlington Dept Comp Sci & Engn Arlington TX 76019 USA Aalto Univ Dept Comp Sci & Engn Aalto 00076 Finland Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA
In most wireless sensor network (WSN) applications, data are typically gathered by sensor nodes and reported to a data collection point called sink. To support such a data collection pattern, a tree structure rooted a... 详细信息
来源: 评论
randomized algorithm for global optimization with bounded memory
收藏 引用
MATHEMATICS AND COMPUTERS IN SIMULATION 2010年 第6期80卷 1068-1081页
作者: Calvin, James M. New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA
We describe a class of adaptive algorithms tor approximating the global minimum of a function defined on a compact subset of R(d) The algorithms are adaptive versions of Monte Carlo search and use a memory of a fixed ... 详细信息
来源: 评论
randomized parameterized algorithms for P2-Packing and Co-Path Packing problems
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2015年 第1期29卷 125-140页
作者: Feng, Qilong Wang, Jianxin Li, Shaohua Chen, Jianer Cent South Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA
In this paper, we study the Parameterized P-2-Packing problem and Parameterized Co-Path Packing problem from random perspective. For the Parameterized P-2-Packing problem, based on the structure analysis of the proble... 详细信息
来源: 评论