咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
The algorithmic complexity of Reverse Signed Domination in Graphs
The Algorithmic Complexity of Reverse Signed Domination in G...
收藏 引用
3rd International Conference on Information Computing and Applications (ICICA 2012)
作者: Li, Wensheng Huang, Zhongsheng Feng, Zhifang Xing, Huaming Fang, Yuejing Langfang Teachers Coll Dept Math & Sci Langfang 065000 Peoples R China
Let G=(V,E) be a simple graph. A function f : V -> {-1, +1} is said to be a reverse signed dominating function if the sum of its function values over any closed neighborhood is at most zero. The reverse signed domi... 详细信息
来源: 评论
algorithmic complexity of FDTD and Ray Tracing method for indoor propagation modeling
Algorithmic complexity of FDTD and Ray Tracing method for in...
收藏 引用
European Conference on Antennas and Propagation
作者: Lajos Nagy Robert Dady Andrea Farkasvolgyi Department of Broadband Infocommunications and Electromagnetic Theory Budapest University of Technology and Economics
Growing interest in providing and improving radio coverage for mobile phones and wireless LANs inside buildings has recently emerged. The need of such coverage appears mainly in office buildings, shopping malls in ver... 详细信息
来源: 评论
algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method
收藏 引用
BEHAVIOR RESEARCH METHODS 2016年 第1期48卷 314-329页
作者: Gauvrit, Nicolas Singmann, Henrik Soler-Toscano, Fernando Zenil, Hector Ecole Prat Hautes Etud CHArt PARIS Reasoning Paris France Univ Freiburg Inst Psychol Hugstetter Str 55 D-79106 Freiburg Germany Univ Seville Grp Log Lenguaje & Informac Seville Spain Karolinska Inst Ctr Mol Med Unit Computat Med Stockholm Sweden
Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed coding theorem method the complexity of st... 详细信息
来源: 评论
A Covert Timing Channel via algorithmic complexity Attacks: Design and Analysis
A Covert Timing Channel via Algorithmic Complexity Attacks: ...
收藏 引用
IEEE International Conference on Communications Workshops
作者: Xiaoshan Sun Liang Cheng Yang Zhang State Key Laboratory of Information Security Graduate School of Chinese Academy of Sciences State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences
A covert channel is a communication channel that bypasses the access controls of the system, and it is a threat to the system's security. In this paper, we propose a new covert timing channel which exploits the al... 详细信息
来源: 评论
COUNTERFACTUAL ANALYSIS BY algorithmic complexity: A METRIC BETWEEN POSSIBLE WORLDS
收藏 引用
MANUSCRITO 2022年 第4期45卷 1-35页
作者: Correa, Nicholas de Oliveira, Nythamar Fernandes Pontificia Univ Catolica Rio Grande do Sul Dept Philosophy Grad Program Philosophy Porto Alegre RS Brazil
Counterfactuals have become an important area of interdisciplinary interest, especially in logic, philosophy of language, epistemology, metaphysics, psychology, decision theory, and even artificial intelligence. In th... 详细信息
来源: 评论
Positive existential definability in finite structures
收藏 引用
DISCRETE APPLIED MATHEMATICS 2025年 366卷 210-215页
作者: Romov, Boris A. New York USA
For a finite structure Mon the domain of k >= 2 elements consider the description of the Galois closures InvEnd(M) and InvAut(M) (the set of relations on the domain of M that are invariant to all endomorphisms, res... 详细信息
来源: 评论
The EXACT SUBSET MULTICOVER problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1024卷
作者: Benoist, Emile Fertin, Guillaume Jean, Geraldine Nantes Univ Ecole Cent Nantes CNRS IS2NUMR 6004 F-44000 Nantes France
In this paper, we study the EXACT SUBSET MULTICOVER problem (or ESM), which can be seen as an extension of the well-known SET COVER problem. Let (U , f) be a multiset built from set U = {e1, e2, ... , em} and function... 详细信息
来源: 评论
To the logical foundations of random number generator construction
收藏 引用
JOURNAL OF LOGIC AND COMPUTATION 2025年 第4期35卷
作者: Enikeev, Ruslan Samara State Tech Univ Dept Ind Heat Power Molodogvardeyskaya St 244 Samara 443100 Russia
This study explores fundamental aspects of probability theory within the framework of constructing random sequences random number generators. We propose an interpretation of probability spaces and operations on formal... 详细信息
来源: 评论
Bounds on the dimension of lineal extensions
收藏 引用
JOURNAL OF FRACTAL GEOMETRY 2025年 第1-2期12卷 105-133页
作者: Bushling, Ryan E. G. Fiedler, Jacob B. Univ Washington Dept Math Box 354350 Seattle WA 98195 USA Univ Wisconsin Madison Dept Math 480 Lincoln Dr213 Van Vleck Hall Madison WI 53706 USA
Let E c Rn be a union of line segments and F c Rn the set obtained from E by extending each line segment in E to a full line. Keleti's line segment extension conjecture posits that the Hausdorff dimension of F sho... 详细信息
来源: 评论
algorithmic Profiling for Real-World complexity Problems
收藏 引用
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2021年 第7期48卷 2680-2694页
作者: Qin, Boqin Tu, Tengfei Liu, Ziheng Yu, Tingting Song, Linhai Beijing Univ Posts & Telecommun Beijing 100876 Peoples R China Penn State Univ University Pk PA 16802 USA Univ Kentucky Lexington KY 40506 USA
complexity problems are a common type of performance issues, caused by algorithmic inefficiency. algorithmic profiling aims to automatically attribute execution complexity to an executed code construct. It can identif... 详细信息
来源: 评论