咨询与建议

限定检索结果

文献类型

  • 206 篇 期刊文献
  • 84 篇 会议
  • 2 篇 学位论文
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

  • 192 篇 工学
    • 137 篇 计算机科学与技术...
    • 35 篇 电气工程
    • 24 篇 软件工程
    • 18 篇 控制科学与工程
    • 17 篇 信息与通信工程
    • 7 篇 机械工程
    • 6 篇 仪器科学与技术
    • 6 篇 电子科学与技术(可...
    • 5 篇 生物医学工程(可授...
    • 3 篇 船舶与海洋工程
    • 3 篇 环境科学与工程(可...
    • 2 篇 力学(可授工学、理...
  • 140 篇 理学
    • 86 篇 数学
    • 23 篇 物理学
    • 17 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 6 篇 系统科学
    • 5 篇 科学技术史(分学科...
    • 3 篇 化学
    • 3 篇 生态学
  • 17 篇 管理学
    • 16 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 14 篇 医学
    • 7 篇 临床医学
    • 6 篇 基础医学(可授医学...
  • 12 篇 教育学
    • 10 篇 心理学(可授教育学...
    • 2 篇 教育学
  • 10 篇 农学
  • 8 篇 经济学
    • 7 篇 应用经济学
  • 5 篇 哲学
    • 5 篇 哲学
  • 4 篇 文学
    • 3 篇 外国语言文学
  • 2 篇 法学
  • 2 篇 历史学
    • 2 篇 世界史

主题

  • 293 篇 algorithmic comp...
  • 11 篇 computational co...
  • 8 篇 entropy
  • 8 篇 complexity
  • 6 篇 approximation al...
  • 5 篇 algorithms
  • 5 篇 randomness
  • 4 篇 performance
  • 4 篇 modeling
  • 4 篇 algorithmic info...
  • 4 篇 complexity class...
  • 4 篇 incremental comp...
  • 4 篇 mixed hypergraph
  • 4 篇 optimization
  • 4 篇 noise
  • 4 篇 information cont...
  • 4 篇 machine learning
  • 4 篇 complexity theor...
  • 4 篇 np-complete
  • 4 篇 turing machine

机构

  • 4 篇 univ seville grp...
  • 2 篇 univ fed flumine...
  • 2 篇 odessa
  • 2 篇 carleton univ sc...
  • 2 篇 lomonosov moscow...
  • 2 篇 budapest univ te...
  • 2 篇 santa fe inst 13...
  • 2 篇 ecole prat haute...
  • 2 篇 univ estadual ca...
  • 2 篇 massey univ well...
  • 2 篇 univ fed rio de ...
  • 2 篇 univ pannonia de...
  • 2 篇 univ auckland de...
  • 2 篇 hungarian acad s...
  • 2 篇 moscow mv lomono...
  • 2 篇 weta digital wel...
  • 2 篇 labores algorith...
  • 2 篇 univ mar del pla...
  • 2 篇 univ pannonia de...
  • 2 篇 hungarian acad s...

作者

  • 10 篇 zenil hector
  • 10 篇 fertin guillaume
  • 7 篇 gauvrit nicolas
  • 6 篇 jean geraldine
  • 6 篇 soler-toscano fe...
  • 5 篇 tuza zsolt
  • 4 篇 franz arthur
  • 4 篇 delahaye jean-pa...
  • 4 篇 bouhamed heni
  • 4 篇 masmoudi afif
  • 3 篇 danchin antoine
  • 3 篇 rusu irena
  • 3 篇 lecroq thierry
  • 3 篇 retvari gabor
  • 3 篇 bulteau laurent
  • 3 篇 bujtas csilla
  • 3 篇 rebai ahmed
  • 2 篇 akian marianne
  • 2 篇 anand m
  • 2 篇 sanchez jr

语言

  • 267 篇 英文
  • 22 篇 其他
  • 2 篇 中文
  • 1 篇 德文
  • 1 篇 西班牙文
  • 1 篇 法文
  • 1 篇 荷兰文
检索条件"主题词=Algorithmic complexity"
293 条 记 录,以下是121-130 订阅
排序:
Active noise control with on-line estimation of non-Gaussian noise characteristics
收藏 引用
JOURNAL OF SOUND AND VIBRATION 2012年 第1期331卷 27-40页
作者: Bergamasco, Marco Della Rossa, Fabio Piroddi, Luigi Politecn Milan Dipartimento Elettr & Informaz I-20133 Milan Italy
Active noise control (ANC) is a methodology for attenuating noise based on adaptive signal processing algorithms. ANC is well assessed for the attenuation of Gaussian noise, but the rejection of non-Gaussian impulsive... 详细信息
来源: 评论
Mixing Time of Metropolis-Hastings for Bayesian Community Detection
收藏 引用
JOURNAL OF MACHINE LEARNING RESEARCH 2021年 第1期22卷 1-89页
作者: Zhuo, Bumeng Gao, Chao Univ Chicago Dept Stat Chicago IL 60637 USA
We study the computational complexity of a Metropolis-Hastings algorithm for Bayesian community detection. We first establish a posterior strong consistency result for a natural prior distribution on stochastic block ... 详细信息
来源: 评论
Interval-valued computations and their connection with PSPACE
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第3期394卷 208-222页
作者: Nagy, Benedek Valyi, Sandor Univ Debrecen Fac Informat Dept Comp Sci H-4010 Debrecen Hungary Univ Rovira & Virgili Res Grp Math Linguist Tarragona Spain
At the conference CiE 2005, the first author introduced a new model for analog computations, namely interval-valued computations. In this model, computations work on the so-called interval-valued bytes, which are spec... 详细信息
来源: 评论
A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers
收藏 引用
IEEE TRANSACTIONS ON SIGNAL PROCESSING 2022年 70卷 5913-5925页
作者: Perera, Sirani M. Lingsch, Levi Madanayake, Arjuna Mandal, Soumyajit Mastronardi, Nicola Embry Riddle Aeronaut Univ Dept Math Daytona Beach FL 32114 USA Embry Riddle Aeronaut Univ Dept Aerosp Engn Daytona Beach FL 32114 USA FL Int Univ Dept Elect & Comp Engn Miami FL 33174 USA Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA Ist Applicazioni CalcoloM Picone Consiglio Nazl Ric CNR I-70126 Bari Italy
This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursive algorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The... 详细信息
来源: 评论
Efficient inclusion checking for deterministic tree automata and XML schemas
收藏 引用
INFORMATION AND COMPUTATION 2009年 第11期207卷 1181-1208页
作者: Champavere, Jerome Gilleron, Remi Lemay, Aurelien Niehren, Joachim Inria Lille Nord Europe Parc Sci Haute Borne F-59650 Villeneuve Dascq France Univ Lille Lab Informat Fondamentale Lille Lille France
We present algorithms for testing language inclusion L(A) subset of L(B) between tree automata in time O(vertical bar A vertical bar . vertical bar B vertical bar) where B is deterministic (bottom-up or top-down). We ... 详细信息
来源: 评论
Global algorithm for effectively solving min-max affine fractional programs
收藏 引用
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2024年 第2期70卷 1787-1811页
作者: Jiao, Hongwei Sun, Yudong Wang, Wenjie Shang, Youlin Henan Inst Sci & Technol Sch Math Sci Xinxiang 453003 Peoples R China Henan Univ Sci & Technol Sch Math & Stat Luoyang 471023 Peoples R China
This article investigates solving the min-max affine fractional programming problem (MAFPP), which arises in systems science and engineering. For globally solving the MAFPP, based on the outer space branching search, ... 详细信息
来源: 评论
A general framework for path convexities
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年 第5期43卷 994-1009页
作者: Thompson, Joao Vinicius C. Nogueira, Loana T. Protti, Fabio Bravo, Raquel S. F. Dourado, Mitre C. Souza, Ueverton S. CEFET Petropolis Petropolis RJ Brazil Univ Fed Fluminense Niteroi RJ Brazil Univ Fed Rio de Janeiro Rio De Janeiro Brazil
In this work we deal with the so-calledpath convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-knowngeodesic convexity, whi... 详细信息
来源: 评论
Digraphs with proper connection number two
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 873卷 64-75页
作者: Li, Luyi Li, Xueliang Nankai Univ Ctr Combinator Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China
A directed path in a digraph is proper if any two consecutive arcs on the path have distinct colors. An arc-colored digraph D is proper connected if for any two distinct vertices x and y of D, there are both proper (x... 详细信息
来源: 评论
PORTREP - A PORTABLE REPEATED STRING FINDER
收藏 引用
SOFTWARE-PRACTICE & EXPERIENCE 1989年 第1期19卷 63-77页
作者: JONES, LP GASSIE, EW RADHAKRISHNAN, S LOUISIANA STATE UNIV SCH LIB SCIBATON ROUGELA 70893
AbstractIn recent years, several authors have presented algorithms that locate instances of a given string, or set of strings, within a text. Recently, authors have given less consideration to the complementary proble... 详细信息
来源: 评论
Action Logic is Undecidable
收藏 引用
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2021年 第2期22卷 1–26页
作者: Kuznetsov, Stepan Russian Acad Sci Steklov Math Inst 8 Gubkina St Moscow Russia
Action logic is the algebraic logic (inequational theory) of residuated Kleene lattices. One of the operations of this logic is the Kleene star, which is axiomatized by an induction scheme. For a stronger system that ... 详细信息
来源: 评论