咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是151-160 订阅
排序:
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity
收藏 引用
DISCRETE MATHEMATICS 2013年 第19期313卷 1965-1977页
作者: Bujtas, Csilla Tuza, Zsolt Univ Pannonia Dept Comp Sci & Syst Technol Veszprem Hungary Hungarian Acad Sci Alfred Renyi Inst Math Budapest Hungary
A stably bounded hypergraph H is a hypergraph together with four color-bound functions s, t, a and b, each assigning positive integers to the edges. A vertex coloring of H is considered proper if each edge E has at le... 详细信息
来源: 评论
A new complexity measure for time series analysis and classification
收藏 引用
EUROPEAN PHYSICAL JOURNAL-SPECIAL TOPICS 2013年 第3-4期222卷 847-860页
作者: Nagaraj, Nithin Balasubramanian, Karthi Dey, Sutirth Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Elect & Commun Engn Kollam 690525 Kerala India Indian Inst Sci Educ & Res Div Biol Pune 411021 Maharashtra India Natl Inst Adv Studies Sch Nat Sci & Engn Adjunct Fac Bangalore 560012 Karnataka India
complexity measures are used in a number of applications including extraction of information from data such as ecological time series, detection of non-random structure in biomedical signals, testing of random number ... 详细信息
来源: 评论
SIMPLIFIED ADDRESSING SCHEME FOR MIXED RADIX FFT ALGORITHMS
SIMPLIFIED ADDRESSING SCHEME FOR MIXED RADIX FFT ALGORITHMS
收藏 引用
IEEE International Conference on Acoustics, Speech and Signal Processing
作者: Cuimei Ma Yizhuang Xie He Chen Yi Deng Wen Yan Beijing Institute of Technology Beijing 100081 China Virginia Polytechnic Institute and State University Arlington VA 22044 USA
A mixed radix algorithm for the in-place fast Fourier transform (FFT), which is broadly used in most embedded signal processing fields, can be explicitly expressed by an iterative equation based on the Cooley-Tukey al... 详细信息
来源: 评论
Colorability of mixed hypergraphs and their chromatic inversions
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2013年 第4期25卷 737-751页
作者: Hegyhati, Mate Tuza, Zsolt Univ Pannonia Dept Comp Sci & Syst Technol H-8200 Veszprem Hungary Hungarian Acad Sci Alfred Reny Inst Math H-1053 Budapest Hungary
We solve a long-standing open problem concerning a discrete mathematical model, which has various applications in computer science and several other fields, including frequency assignment and many other problems on re... 详细信息
来源: 评论
complexity Analysis of Chaotically Encrypted Rate-1/n Convolutional Encoders
收藏 引用
Procedia Computer Science 2013年 20卷 528-534页
作者: Davoud Arasteh Electrical Engineering Department Southern University and A & M College Baton Rouge Louisiana USA
In this paper we have studied the performance of chaotically encrypted rate-1/n convolutional encoders. The design goal is to achieve a crypto-coding system that possesses the error correction and encryption features.... 详细信息
来源: 评论
Network Reliability Analysis with Unreliable Information
Network Reliability Analysis with Unreliable Information
收藏 引用
9th International Conference on the Design of Reliable Communication Networks (DRCN)
作者: Farago, Andras Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA
The general task of network reliability analysis is this: given some probabilistic information about the possible failures of network components, we want to compute a global reliability metric for the network. This ge... 详细信息
来源: 评论
The Best-partitions Problem: How to Build Meaningful Aggregations
The Best-partitions Problem: How to Build Meaningful Aggrega...
收藏 引用
12th IEEE/WIC/ACM International Joint Conference on Intelligent Agent Technology (IAT)
作者: Lamarche-Perrin, Robin Demazeau, Yves Vincent, Jean-Marc Univ Grenoble Alpes LIG Grenoble France CNRS LIG F-75700 Paris France
The design and the debugging of large distributed AI systems require abstraction tools to build tractable macroscopic descriptions. Data aggregation provides such tools by partitioning the system dimensions into aggre... 详细信息
来源: 评论
ALAN TURING AND THE ORIGINS OF complexity
收藏 引用
ARBOR-CIENCIA PENSAMIENTO Y CULTURA 2013年 第764期189卷
作者: Martin-Delgado, Miguel-Angel Univ Complutense Dept Fis Teor 1 E-28040 Madrid Spain
The 75th anniversary of Turing's seminal paper and his centennial anniversary occur in 2011 and 2012, respectively. It is natural to review and assess Turing's contributions in diverse fields in the light of n... 详细信息
来源: 评论
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
收藏 引用
JOURNAL OF DISCRETE ALGORITHMS 2013年 19卷 1-22页
作者: Bulteau, Laurent Fertin, Guillaume Rusu, Irena Univ Nantes CNRS UMR 6241 LINA 2 Rue Houssiniere F-44322 Nantes 3 France
Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of markers from each map such that the two extracted... 详细信息
来源: 评论
Gradual Sub-lattice Reduction and a New complexity for Factoring Polynomials
收藏 引用
algorithmicA 2012年 第3期63卷 616-633页
作者: van Hoeij, Mark Novocin, Andrew ENS Lyon F-69364 Lyon 07 France Florida State Univ Tallahassee FL 32306 USA LIP CNRS ENSL INRIA UCBL U Lyon F-69364 Lyon 07 France
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors ha... 详细信息
来源: 评论