咨询与建议

限定检索结果

文献类型

  • 1,280 篇 期刊文献
  • 60 篇 会议
  • 3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 1,138 篇 工学
    • 998 篇 计算机科学与技术...
    • 112 篇 软件工程
    • 101 篇 力学(可授工学、理...
    • 70 篇 电气工程
    • 34 篇 控制科学与工程
    • 29 篇 信息与通信工程
    • 7 篇 电子科学与技术(可...
    • 6 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 材料科学与工程(可...
    • 1 篇 冶金工程
    • 1 篇 测绘科学与技术
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 食品科学与工程(可...
  • 491 篇 理学
    • 384 篇 数学
    • 103 篇 物理学
    • 33 篇 统计学(可授理学、...
    • 9 篇 生物学
    • 1 篇 地球物理学
    • 1 篇 系统科学
    • 1 篇 科学技术史(分学科...
  • 156 篇 管理学
    • 133 篇 管理科学与工程(可...
    • 23 篇 图书情报与档案管...
    • 12 篇 工商管理
  • 13 篇 经济学
    • 13 篇 应用经济学
  • 4 篇 教育学
    • 4 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 2 篇 医学
    • 2 篇 临床医学
  • 2 篇 军事学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 农学

主题

  • 1,343 篇 analysis of algo...
  • 108 篇 computational co...
  • 87 篇 data structures
  • 80 篇 algorithms
  • 80 篇 design of algori...
  • 79 篇 combinatorial pr...
  • 71 篇 computational ge...
  • 56 篇 approximation al...
  • 50 篇 graph algorithms
  • 40 篇 parallel algorit...
  • 35 篇 random graphs
  • 35 篇 online algorithm...
  • 33 篇 networks
  • 31 篇 sorting
  • 27 篇 dynamic programm...
  • 27 篇 scheduling
  • 25 篇 parallel process...
  • 24 篇 on-line algorith...
  • 22 篇 hashing
  • 21 篇 competitive anal...

机构

  • 11 篇 vidyasagar univ ...
  • 9 篇 purdue univ dept...
  • 8 篇 technion israel ...
  • 7 篇 univ calif river...
  • 7 篇 zhejiang univ de...
  • 6 篇 univ freiburg in...
  • 6 篇 purdue univ dept...
  • 6 篇 at&t bell labs m...
  • 5 篇 columbia univ gr...
  • 5 篇 univ illinois de...
  • 5 篇 brown univ dept ...
  • 5 篇 columbia univ de...
  • 5 篇 inst math sci ma...
  • 5 篇 univ stellenbosc...
  • 4 篇 tel aviv univ sc...
  • 4 篇 ibm corp thomas ...
  • 4 篇 univ waterloo de...
  • 4 篇 georgia inst tec...
  • 4 篇 univ paris 09 la...
  • 4 篇 brown univ dept ...

作者

  • 11 篇 neininger r
  • 11 篇 pal madhumangal
  • 11 篇 lee dt
  • 10 篇 vitter js
  • 9 篇 devroye l
  • 9 篇 hassin r
  • 8 篇 atallah mj
  • 8 篇 pal m
  • 7 篇 flajolet p
  • 7 篇 zdeborova lenka
  • 7 篇 italiano gf
  • 7 篇 apostolico a
  • 7 篇 hambrusch se
  • 7 篇 han yj
  • 7 篇 rubinstein s
  • 7 篇 ward mark daniel
  • 7 篇 preparata fp
  • 6 篇 szpankowski w
  • 6 篇 tang cy
  • 6 篇 mondal sukumar

语言

  • 1,280 篇 英文
  • 63 篇 其他
检索条件"主题词=Analysis of Algorithms"
1343 条 记 录,以下是91-100 订阅
排序:
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第6期107卷 240-245页
作者: Goldwasser, Michael H. Misra, Arundhati Bagchi St Louis Univ Dept Math & Comp Sci St Louis MO 63103 USA Mississippi State Univ Dept Math & Stat Mississippi State MS 39762 USA
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the number of jobs completed by their deadline... 详细信息
来源: 评论
Worst-case analysis of the Iterated Longest Fragment algorithm
收藏 引用
INFORMATION PROCESSING LETTERS 2001年 第3期79卷 147-153页
作者: Békési, J Galambos, G Univ Szeged TTC Dept Comp Sci H-6701 Szeged Hungary
For parallel machine architecture the Iterated Longest Fragment algorithm was investigated by Stauffer and Hirschberg [Proc. 8th Int. Parallel Process. Symp., 1994, pp. 344-348] for compressing a text with a static di... 详细信息
来源: 评论
Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids
收藏 引用
INFORMATION PROCESSING LETTERS 2007年 第4期104卷 117-122页
作者: Zhou, Yuren He, Jun S China Univ Technol Sch Comp Sci & Engn Guangzhou 510640 Peoples R China Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England
Evolutionary algorithms have been successfully applied to various multi-objective optimization problems. However, theoretical studies on multi-objective evolutionary algorithms, especially with self-adaption, are rela... 详细信息
来源: 评论
EXPECTED TIME analysis OF INTERPOLATION MERGE - A SIMPLE NEW MERGING ALGORITHM
收藏 引用
INFORMATION PROCESSING LETTERS 1991年 第5期40卷 277-281页
作者: GUHA, S SEN, A ARIZONA STATE UNIV DEPT COMP SCITEMPEAZ 85287
Binary merge is the best general-purpose merging algorithm known to date. Binary merge consists of two components: a first component in which an array index is incremented by a number nearly equal to the ratio of the ... 详细信息
来源: 评论
On the analysis of Bloom filters
收藏 引用
INFORMATION PROCESSING LETTERS 2018年 129卷 35-39页
作者: Grandi, Fabio Univ Bologna Dept Comp Sci & Engn DISI Alma Mater Studiorum Viale Risorgimento 2 I-40135 Bologna BO Italy
The Bloom filter is a simple random binary data structure which can be efficiently used for approximate set membership testing. When testing for membership of an object, the Bloom filter may give a false positive, who... 详细信息
来源: 评论
WORST CASE analysis OF A GRAPH-COLORING ALGORITHM
收藏 引用
DISCRETE APPLIED MATHEMATICS 1985年 第1期12卷 89-92页
作者: SPINRAD, JP VIJAYAN, G School of Information and Computer Science Georgia Institute of Technology Atlanta GA 30332 USA
In this paper, we show that a graph coloring heuristic developed by Brélaz may use n colors to color a 3-colorable graph with O( n ) vertices.
来源: 评论
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第3期105卷 88-92页
作者: Attiratanasunthron, Nattapat Fakcharcienphol, Jittat Kasetsari Univ Dept Comp Engn Bangkok 10900 Thailand
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. More specifically, we show that the ex... 详细信息
来源: 评论
analysis OF N-TREES
收藏 引用
INFORMATION PROCESSING LETTERS 1983年 第3期16卷 131-137页
作者: TAMMINEN, M Helsinki University of Technology Laboratory of Information Processing Science 02150 ESPOO 15 Finland
The asymptotic expected storage and access efficiency of recursive bucket methods (N-trees) is examined. Much is known about the expected behavior of N-partitions, even assuming a general distribution of keys. The e... 详细信息
来源: 评论
An average analysis of backtracking on random constraint satisfaction problems
收藏 引用
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2001年 第1期33卷 21-37页
作者: Xu, K Li, W Beijing Univ Aeronaut & Astronaut Dept Comp Sci & Engn Natl Lab Software Dev Environm Beijing 100083 Peoples R China
In this paper we propose a random CSP model, called Model GB, which is a natural generalization of standard Model B. This paper considers Model GB in the case where each constraint is easy to satisfy. In this case Mod... 详细信息
来源: 评论
analysis OF SLIDING WINDOW TECHNIQUES FOR EXPONENTIATION
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 1995年 第10期30卷 17-24页
作者: KOC, CK Department of Electrical & Computer Engineering Oregon State University Corvallis OR 97331 U.S.A.
The m-ary method for computing x(E) partitions the bits of the integer E into words of constant length, and then performs as many multiplications as there are nonzero words. Variable length partitioning strategies hav... 详细信息
来源: 评论