咨询与建议

限定检索结果

文献类型

  • 41 篇 期刊文献
  • 7 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 37 篇 工学
    • 31 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 5 篇 软件工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 信息与通信工程
  • 27 篇 理学
    • 26 篇 数学
    • 5 篇 统计学(可授理学、...
    • 1 篇 物理学
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...

主题

  • 48 篇 average complexi...
  • 4 篇 analysis of algo...
  • 3 篇 finite automata
  • 2 篇 markov chains
  • 2 篇 generic complexi...
  • 2 篇 algorithms
  • 2 篇 pattern matching
  • 2 篇 brownian motion
  • 2 篇 computational ge...
  • 2 篇 linear programmi...
  • 2 篇 parameters of in...
  • 2 篇 interchanges
  • 2 篇 global optimizat...
  • 2 篇 convex hull
  • 2 篇 probabilistic an...
  • 2 篇 graph coloring
  • 2 篇 lower bounds
  • 1 篇 backtracking alg...
  • 1 篇 distributed arch...
  • 1 篇 random search

机构

  • 1 篇 univ politecn ca...
  • 1 篇 ecole polytechn ...
  • 1 篇 univ lyon 1 cnrs...
  • 1 篇 univ chicago dep...
  • 1 篇 ajou univ sch ie...
  • 1 篇 aix marseille un...
  • 1 篇 inria cachan
  • 1 篇 department of ma...
  • 1 篇 univ caen f-1403...
  • 1 篇 ecole normale su...
  • 1 篇 shanghai jiao to...
  • 1 篇 univ lubeck inst...
  • 1 篇 chinese acad sci...
  • 1 篇 tel aviv univ ra...
  • 1 篇 katholieke univ ...
  • 1 篇 univ maryland de...
  • 1 篇 univ. of souther...
  • 1 篇 cnrs cachan
  • 1 篇 univ paris 13 cn...
  • 1 篇 inria paris

作者

  • 3 篇 david julien
  • 3 篇 nicaud cyril
  • 2 篇 chakraborty soub...
  • 2 篇 didier gilles
  • 2 篇 feuilloley laure...
  • 1 篇 lhote loick
  • 1 篇 miguel pardo lui...
  • 1 篇 tonelli-cueto jo...
  • 1 篇 beltran carlos
  • 1 篇 carayol arnaud
  • 1 篇 denise alain
  • 1 篇 avanzini martin
  • 1 篇 yang jun
  • 1 篇 moser georg
  • 1 篇 lauria massimo
  • 1 篇 sourabh suman ku...
  • 1 篇 diaz j
  • 1 篇 xu k
  • 1 篇 yang feiran
  • 1 篇 mcdiarmid cjh

语言

  • 42 篇 英文
  • 6 篇 其他
检索条件"主题词=Average complexity"
48 条 记 录,以下是31-40 订阅
排序:
Low complexity dynamic scheduling algorithm for real-time tasks
收藏 引用
ELECTRONICS LETTERS 1999年 第24期35卷 2106-2108页
作者: Jung, G Kim, T Park, S Choi, K Ajou Univ Sch EE Suwon 442749 South Korea ETRI Taejon 305350 South Korea Ajou Univ Sch IE & CE Suwon 442749 South Korea
It is shown that the problem of maximising the total reward of online tasks can be solved by finding the minimum of the maximum derivatives of the reward functions. Based on the modified approach and a close observati... 详细信息
来源: 评论
The average complexity of a coin-weighing problem
收藏 引用
RANDOM STRUCTURES & ALGORITHMS 1996年 第1-2期9卷 1-14页
作者: Alonso, L Chassaing, P Schott, R INST ELIE CARTAN F-54506 VANDOEUVRE NANCYFRANCE
Given a set of n coins, some of them weighing H, the others weighing h, h < H, we prove that to determine the set of heavy coins, an optimal algorithm requires an average of 1+rho(2)/1+rho+rho(2) n + O(1) compariso... 详细信息
来源: 评论
An average complexity measure that yields tight hierarchies
收藏 引用
Computational complexity 1996年 第2期6.0卷 133-173页
作者: Reischuk, Rüdiger Schindelhauer, Christian Inst. für Theor. Informatik Med. Hochschule zu Lübeck D-23560 Lübeck Wallstr. 40 Germany
A new definition is given for the average growth of a function f : Σ* → N with respect to a probability measure μ on Σ*. This allows us to define meaningful average distributional complexity classes for arbitrary ... 详细信息
来源: 评论
average and randomized complexity of distributed problems
收藏 引用
SIAM JOURNAL ON COMPUTING 1996年 第6期25卷 1254-1267页
作者: AllenbergNavony, N Itai, A Moran, S TECHNION ISRAEL INST TECHNOL DEPT COMP SCIIL-32000 HAIFAISRAEL
Yao proved that in the decision-tree model, the average complexity of the best deterministic algorithm is a lower bound on the complexity of randomized algorithms that solve the same problem. Here it is shown that a s... 详细信息
来源: 评论
average case behavior of random search for the maximum
收藏 引用
JOURNAL OF APPLIED PROBABILITY 1997年 第3期34卷 632-642页
作者: Calvin, JM Glynn, PW STANFORD UNIV DEPT OPERAT RESSTANFORDCA 94305
This paper is a study of the error in approximating the global maximum of a Brownian motion on the unit interval by observing the value at randomly chosen points. One point of view is to look at the error from random ... 详细信息
来源: 评论
DCT computation with minimal average number of operations
DCT computation with minimal average number of operations
收藏 引用
1997 Conference on Visual Communications and Image Processing
作者: Lengwehasatit, K Ortega, A Univ. of Southern California (United States)
The Discrete Cosine Transform (DCT) is widely used in all transform-based image and video compression standards due to its well-known decorrelation and energy compaction properties for typical images. Many fast algori... 详细信息
来源: 评论
average PERFORMANCE OF A CLASS OF ADAPTIVE ALGORITHMS FOR GLOBAL OPTIMIZATION
收藏 引用
ANNALS OF APPLIED PROBABILITY 1997年 第3期7卷 711-730页
作者: Calvin, James M. New Jersey Inst Technol Dept Comp & Informat Sci Newark NJ 07102 USA
We describe a class of adaptive algorithms for approximating the global minimum of a continuous function on the unit interval. The limiting distribution of the error is derived under the assumption of Wiener measure o... 详细信息
来源: 评论
SPARSE-MATRIX VECTOR MULTIPLICATION ON DISTRIBUTED ARCHITECTURES - LOWER BOUNDS AND average complexity RESULTS
收藏 引用
INFORMATION PROCESSING LETTERS 1994年 第5期50卷 231-238页
作者: MANZINI, G Istituto di Matematica Computazionale CNR Piazza dei Cavalieri n. 7 I-56126 Pisa Italy
In this paper we consider the problem of computing y = Ax where A is an n X n sparse matrix with THETA(n) nonzero elements. We prove that, under reasonable assumptions, on a local memory machine with p processors this... 详细信息
来源: 评论
FAST NEAREST-NEIGHBOR SEARCH IN DISSIMILARITY SPACES
收藏 引用
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1993年 第9期15卷 957-962页
作者: FARAGO, A LINDER, T LUGOSI, G Tech. Univ. of Budapest Hungary
A fast nearest-neighbor algorithm is presented. It works in general spaces where the known cell (bucketing) techniques cannot be implemented for various reasons, such as the absence of coordinate structure and/or high... 详细信息
来源: 评论
ON THE average SIZE OF THE INTERSECTION OF BINARY-TREES
收藏 引用
SIAM JOURNAL ON COMPUTING 1992年 第1期21卷 24-32页
作者: BAEZAYATES, R CASAS, R DIAZ, J MARTINEZ, C UNIV POLITECN CATALUNYA DEPT LLENGUATGES & SISTEMESE-08028 BARCELONASPAIN
The average-case analysis of algorithms for binary search trees yields very different results from those obtained under the uniform distribution. The analysis itself is more complex and replaces algebraic equations by... 详细信息
来源: 评论