咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 294 篇 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

语言

  • 268 篇 英文
  • 22 篇 其他
  • 2 篇 中文
  • 1 篇 德文
  • 1 篇 西班牙文
  • 1 篇 法文
  • 1 篇 荷兰文
检索条件"主题词=Algorithmic complexity"
294 条 记 录,以下是191-200 订阅
排序:
Partition Sort and Its Empirical Analysis
Partition Sort and Its Empirical Analysis
收藏 引用
1st International Conference on Computational Intelligence and Information Technology (CIIT 2011)
作者: Singh, Niraj Kumar Chakraborty, Soubhik BIT Mesra Dept Appl Math Ranchi 835215 Bihar India BIT Mesra Dept Comp Sci & Engn Ranchi 835215 Bihar India
In the present paper we have introduced a new sorting algorithm named Partition Sort and performed its empirical study with necessary theoretical analysis. This algorithm was subjected to data coming from various stan... 详细信息
来源: 评论
complexity issues in vertex-colored graph pattern matching
收藏 引用
JOURNAL OF DISCRETE ALGORITHMS 2011年 第1期9卷 82-99页
作者: Dondi, Riccardo Fertin, Guillaume Vialette, Stephane Univ Bergamo Dipartimento Sci Linguaggi Comunicaz & Studi Cult I-24129 Bergamo Italy Univ Nantes LINA UMR CNRS 6241 F-44322 Nantes 3 France Univ Paris Est Marne La Vallee LIGM CNRS UMR 8049 5 Bd Descartes F-77454 Marne La Vallee France
Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In the context of metabolic network analysis, Lacroix et al. [V. Lacroix, C.G. Fernandes, M.-F. Sagot, IEEE/ACM Trans... 详细信息
来源: 评论
Efficient and Robust Localization of Multiple Radiation Sources in Complex Environments
Efficient and Robust Localization of Multiple Radiation Sour...
收藏 引用
31st International Conference on Distributed Computing Systems (ICDCS)
作者: Chin, Jren-Chit Yau, David K. Y. Rao, Nageswara S. V. Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Adv Digital Sci Ctr Singapore Singapore Oak Ridge Natl Lab Div Math & Comp Sci Oak Ridge TN 37830 USA
We present a robust localization algorithm for multiple radiation sources using a network of sensors under random underlying physical processes and measurement errors. The proposed solution uses a hybrid formulation o... 详细信息
来源: 评论
Performance of Rate 1/2 Convolutional Encoder with Adaptive Feedback-Controlled on Hyperchaotic-Chaotic States
Performance of Rate 1/2 Convolutional Encoder with Adaptive ...
收藏 引用
Conference of the Complex Adaptive Systems on Responding to Continuous Global Change in Systems Needs
作者: Arasteh, Davoud So Univ & A&M Coll Dept Elect Engn Technol Baton Rouge LA USA
In this paper we have studied the performance of rate. 1/2 convolutional encoders with adaptive states developed in chaotic and hyperchaotic regions. These states are generated by varying the control parameters in a f... 详细信息
来源: 评论
Program-size versus Time complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines
收藏 引用
INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 2011年 第5期7卷 353-387页
作者: Joosten, Joost J. Soler-Toscano, Fernando Zenil, Hector Univ Barcelona Dept Log Hist & Filosofia Ciencia E-08007 Barcelona Spain Univ Seville Dept Filosofia Log & Filosofia Ciencia Grp Log Lenguaje & Informac Seville Spain Univ Sheffield Regent Court Kroto Res Inst Sheffield S14DP S Yorkshire England
The aim of this paper is to undertake an experimental investigation of the trade-offs between program-size and time computational complexity. The investigation includes an exhaustive exploration and systematic study o... 详细信息
来源: 评论
Entropy and algorithmic complexity in quantum information theory
收藏 引用
Natural Computing 2007年 第2期6卷 133-150页
作者: Benatti, Fabio Department of Theoretical Physics University of Trieste 34014 Trieste Strada Costiera 11 Italy
A theorem of Brudno says that the entropy production of classical ergodic information sources equals the algorithmic complexity per symbol of almost every sequence emitted by such sources. The recent advances in the t... 详细信息
来源: 评论
An application of proof-nets to the study of fragments of the Lambek calculus
收藏 引用
IZVESTIYA MATHEMATICS 2011年 第3期75卷 631-663页
作者: Savateev, Yu. V. Moscow MV Lomonosov State Univ Moscow Russia
We use proof-nets to study the algorithmic complexity of the derivability problem for some fragments of the Lambek calculus. We prove the NP-completeness of this problem for the unidirectional fragment and the product... 详细信息
来源: 评论
Performance of Rate ½ Convolutional Encoder with Adaptive Feedback-Controlled on Hyperchaotic-Chaotic States
收藏 引用
Procedia Computer Science 2011年 6卷 130-135页
作者: Davoud Arasteh Department of Electronic Engineering Technology Southern University and A & M College Baton Rouge Louisiana USA
In this paper we have studied the performance of rate-1/2 convolutional encoders with adaptive states developed in chaotic and hyperchaotic regions. These states are generated by varying the control parameters in a fe... 详细信息
来源: 评论
Performance and complexity Analysis of Infinity-Norm Sphere-Decoding
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2010年 第3期56卷 1085-1105页
作者: Seethaler, Dominik Boelcskei, Helmut Vienna Univ Technol Inst Commun & Radiofrequency Engn A-1040 Vienna Austria ETH Dept Informat Technol & Elect Engn CH-8092 Zurich Switzerland
Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) norm that is used to conduct the tree traversal ... 详细信息
来源: 评论
complexity, TIME AND MUSIC
收藏 引用
ADVANCES IN COMPLEX SYSTEMS 2010年 第2期13卷 155-164页
作者: Boon, Jean Pierre Univ Libre Bruxelles Phys Dept CP 231 B-1050 Brussels Belgium
The concept of complexity as considered in terms of its algorithmic definition proposed by G. J. Chaitin and A. N. Kolmogorov is revisited for the dynamical complexity of music. When music pieces are cast in the form ... 详细信息
来源: 评论