咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是521-530 订阅
排序:
Analysis of a randomized rendezvous algorithm
收藏 引用
INFORMATION AND COMPUTATION 2003年 第1期184卷 109-128页
作者: Métivier, Y Saheb, N Zemmari, A Univ Bordeaux 1 ENSEIRB LaBRI F-33405 Talence France
In this paper we propose and analyze a randomized algorithm to get rendezvous between neighbours in an anonymous graph. We examine in particular the probability to obtain at least one rendezvous and the expected numbe... 详细信息
来源: 评论
Locally guided randomized elections in trees:: The totally fair case
收藏 引用
INFORMATION AND COMPUTATION 2005年 第1期198卷 40-55页
作者: Métivier, Y Saheb-Djahromi, N Zemmari, A Univ Bordeaux 1 LaBRI ENSEIRB F-33405 Talence France
We design and analyze a randomized one-passage election algorithm in trees based on a result of Angluin in [Proceedings of the 12th Symposium on Theory of Computing, 1980, pp. 82]. The election process is a distribute... 详细信息
来源: 评论
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
收藏 引用
INFORMATION AND COMPUTATION 2005年 第1-2期199卷 107-131页
作者: Gulwani, S Necula, GC Univ Calif Berkeley Dept Comp Sci Berkeley CA 94720 USA
We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process t... 详细信息
来源: 评论
randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors
收藏 引用
Acta Mathematicae Applicatae Sinica 2005年 第3期21卷 485-488页
作者: Dong-lei Du Faculty of Administration University of New Brunswick P.O. Box 4400 Fredericton NB E3B 5V4 Canada
In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors without pree... 详细信息
来源: 评论
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
收藏 引用
19th International Conference on Automated Deduction (CADE-19)
作者: Gulwani, S Necula, GC Univ Calif Berkeley Dept Comp Sci Berkeley CA 94720 USA
We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process t... 详细信息
来源: 评论
A fast, accurate, and simple method for pricing European-Asian and Saving-Asian options
收藏 引用
algorithmICA 2005年 第2期42卷 141-158页
作者: Ohta, K Sadakane, K Shioura, A Tokuyama, T DC Card Co Ltd Tokyo Japan Kyushu Univ Grad Sch Informat Sci & Elect Engn Fukuoka 8128581 Japan Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
We propose an efficient and accurate randomized approximation algorithm for computing the price of European-Asian options. Our algorithm can be seen as a modification of the approximation algorithm developed by Aingwo... 详细信息
来源: 评论
Narrow passage sampling for probabilistic roadmap planning
收藏 引用
IEEE TRANSACTIONS ON ROBOTICS 2005年 第6期21卷 1105-1115页
作者: Sun, Z Hsu, D Jiang, TT Kurniawati, H Reif, JH Hong Kong Baptist Univ Dept Comp Sci Kowloon Hong Kong Peoples R China Natl Univ Singapore Dept Comp Sci Singapore 117543 Singapore Duke Univ Dept Comp Sci Durham NC 27708 USA
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but sampling narrow passages in a robot's configuration space remains a challenge for PRM planners... 详细信息
来源: 评论
Improving lookup latency in distributed hash table systems using random sampling
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2005年 第5期13卷 1121-1134页
作者: Zhang, H Goel, A Govindan, R Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wid... 详细信息
来源: 评论
On the one-sided crossing minimization in a bipartite graph with large degrees
收藏 引用
THEORETICAL COMPUTER SCIENCE 2005年 第1-3期332卷 417-446页
作者: Nagamochi, H Kyoto Univ Dept Appl Math & Phys Kyoto 6068501 Japan
Given a bipartite graph G = (V, W, E), a 2-layered drawing consists of placing nodes in the first node set V on a straight line L-1 and placing nodes in the second node set Won a parallel line L-2. For a given orderin... 详细信息
来源: 评论
On the complexity of computing determinants
收藏 引用
COMPUTATIONAL COMPLEXITY 2005年 第3-4期13卷 91-130页
作者: Kaltofen, E Villard, G N Carolina State Univ Dept Math Raleigh NC 27695 USA Ecole Normale Super Lyon Lab LIP F-69364 Lyon 07 France
We present new baby steps/giant steps algorithms of asymptotically fast running time for dense matrix problems. Our algorithms compute the determinant, characteristic polynomial, Frobenius normal form and Smith normal... 详细信息
来源: 评论