咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
A Modular Cost Analysis for Probabilistic Programs
收藏 引用
PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2020年 第OOPSLA期4卷 1–30页
作者: Avanzini, Martin Moser, Georg Schaper, Michael INRIA Sophia Antipolis Valbonne France Univ Innsbruck Innsbruck Austria
We present a novel methodology for the automated resource analysis of non-deterministic, probabilistic imperative programs, which gives rise to a modular approach. Program fragments are analysed in full independence. ... 详细信息
来源: 评论
MOMENT INEQUALITIES FOR RANDOM-VARIABLES IN COMPUTATIONAL GEOMETRY
收藏 引用
COMPUTING 1983年 第2期30卷 111-119页
作者: DEVROYE, L School of Computer Science McGill University Burnside Hall 805 Sherbrooke St. West H3A 2K6 Montreal P.Q. Canada
LetX1,...,X n be independent identically distributedRd-valued random vectors, and letA n =A(X1,...,X n ) be a subset of {X1,...,X n }, invariant under permutations of the data, and possessing the inclusion property (X... 详细信息
来源: 评论
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... 详细信息
来源: 评论
A Computationally Efficient Delayless Frequency-Domain Adaptive Filter Algorithm
收藏 引用
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2013年 第4期60卷 222-226页
作者: Yang, Feiran Wu, Ming Yang, Jun Chinese Acad Sci Inst Acoust State Key Lab Acoust Beijing 100190 Peoples R China Chinese Acad Sci Inst Acoust Key Lab Noise & Vibrat Res Beijing 100190 Peoples R China
In acoustic echo cancellation (AEC) systems, the partitioned block frequency-domain adaptive filter (PBFDAF) algorithm is commonly adopted to improve the computational efficiency and convergence rate. However, the PBF... 详细信息
来源: 评论
EFFICIENT COMPUTATION OF THE MAXIMUM OF THE SUM OF 2 SEQUENCES AND APPLICATIONS
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1986年 第7期35卷 651-653页
作者: KONRAD, V Hewlett-Packard Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions 1+ b1 a2+ b2 ... an+ bn} trivially takes n additions. We show that if we are given the ranking for the a"s and the b"s separately then an algorithm exists which will..." property="og:description">
Computing max{a1+ b1, a2+ b2, ... ,an+ bn} trivially takes n additions. We show that if we are given the ranking for the a"s and the b"s separately, then an algorithm exists which will compute the maximum in... 详细信息
来源: 评论
BACKTRACK - AN O(1) EXPECTED TIME ALGORITHM FOR THE GRAPH-COLORING PROBLEM
收藏 引用
INFORMATION PROCESSING LETTERS 1984年 第3期18卷 119-121页
作者: WILF, HS Department of Mathematics University of Pennsylvania Philadelphia PA 19104 U.S.A.
The following NP-complete problem is considered: Given a graph G and a positive integer K, can the vertices of G be properly colored in K (or fewer) colors? It is shown that the backtrack search tree for this problem ... 详细信息
来源: 评论
Parametric random generation of deterministic tree automata
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第38-39期411卷 3469-3480页
作者: Heam, Pierre-Cyrille Nicaud, Cyril Schmitz, Sylvain ENS Cachan LSV Cachan France CNRS Cachan France INRIA Cachan France CNRS Marne La Vallee France Univ Paris Est LIGM Marne La Vallee France INRIA Besancon France Univ Franche Comte LIFC F-25030 Besancon France
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential letter-to-letter transducers up to isom... 详细信息
来源: 评论
A NOTE ON CONTINUOUS SEARCH ALGORITHMS
收藏 引用
JOURNAL OF APPLIED PROBABILITY 1987年 第1期24卷 277-280页
作者: GAREY, LE GUPTA, RD University of New Brunswick
Continuous random search methods with an average complexity given by O(log(1/ε)) for ε → 0 where ε is a given accuracy were presented in a recent paper. In this article an example of an O(log log(1/ε)) method is ... 详细信息
来源: 评论
AN average-CASE ANALYSIS FOR A CONTINUOUS RANDOM SEARCH ALGORITHM
收藏 引用
ADVANCES IN APPLIED PROBABILITY 1985年 第1期17卷 231-233页
作者: PFEIFER, D RHEIN WESTFAL TH AACHEN INST STAT & WIRTSCHAFTSMATHWULLNERSTR 3D-5100 AACHENFED REP GER
We give an upper bound for the average complexity (i.e. the expected number of steps until termination) for a continuous random search algorithm using results from renewal theory. It is thus possible to show that for ... 详细信息
来源: 评论
Probabilistic analysis of the pure literal heuristic for the satisfiability problem
收藏 引用
Annals of Operations Research 1984年 第3期1卷 273-289页
作者: Franco, John Department of Computer Science Indiana University Bloomington 47405 IN United States
An algorithm for the SATISFIABILITY problem is presented and a probabilistic analysis is performed. The analysis is based on an instance distribution which is parametrized to simulate a variety of sample characteristi... 详细信息
来源: 评论