咨询与建议

限定检索结果

文献类型

  • 3,623 篇 会议
  • 2,204 篇 期刊文献

馆藏范围

  • 5,827 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5,120 篇 工学
    • 4,360 篇 计算机科学与技术...
    • 1,441 篇 软件工程
    • 405 篇 电气工程
    • 275 篇 信息与通信工程
    • 266 篇 控制科学与工程
    • 230 篇 电子科学与技术(可...
    • 216 篇 生物工程
    • 189 篇 力学(可授工学、理...
    • 156 篇 机械工程
    • 134 篇 材料科学与工程(可...
    • 133 篇 化学工程与技术
    • 130 篇 动力工程及工程热...
    • 115 篇 土木工程
    • 105 篇 生物医学工程(可授...
    • 91 篇 光学工程
    • 74 篇 建筑学
    • 70 篇 仪器科学与技术
    • 68 篇 航空宇航科学与技...
  • 2,576 篇 理学
    • 1,707 篇 数学
    • 816 篇 物理学
    • 488 篇 统计学(可授理学、...
    • 257 篇 生物学
    • 164 篇 化学
    • 130 篇 系统科学
    • 62 篇 地球物理学
  • 393 篇 管理学
    • 223 篇 管理科学与工程(可...
    • 179 篇 图书情报与档案管...
    • 121 篇 工商管理
  • 132 篇 法学
    • 129 篇 社会学
  • 89 篇 医学
    • 72 篇 临床医学
  • 51 篇 教育学
  • 47 篇 经济学
  • 11 篇 农学
  • 7 篇 文学
  • 7 篇 军事学
  • 2 篇 哲学
  • 1 篇 艺术学

主题

  • 5,827 篇 computation theo...
  • 9 篇 computational mo...
  • 8 篇 computer science
  • 8 篇 computational co...
  • 7 篇 application soft...
  • 7 篇 game theory
  • 7 篇 controllers
  • 6 篇 discrete event s...
  • 6 篇 control theory
  • 6 篇 linear systems
  • 5 篇 integral equatio...
  • 5 篇 dynamical system...
  • 5 篇 software enginee...
  • 5 篇 non
  • 5 篇 embedded systems
  • 5 篇 optimization
  • 5 篇 logic
  • 5 篇 graph theory
  • 5 篇 automata
  • 5 篇 distributed comp...

机构

  • 9 篇 ieee
  • 9 篇 stanford univers...
  • 7 篇 technion haifa
  • 7 篇 columbia univers...
  • 7 篇 physics departme...
  • 7 篇 carnegie mellon ...
  • 7 篇 carnegie mellon ...
  • 6 篇 department of co...
  • 6 篇 university of to...
  • 6 篇 department of co...
  • 6 篇 univ calif berke...
  • 5 篇 harvard universi...
  • 5 篇 university of ca...
  • 5 篇 department of ma...
  • 5 篇 university colle...
  • 5 篇 mathematics inst...
  • 5 篇 university of sy...
  • 5 篇 school of comput...
  • 5 篇 massachusetts in...
  • 5 篇 deutsches elektr...

作者

  • 8 篇 wagner marc
  • 7 篇 li wei
  • 6 篇 ishai yuval
  • 5 篇 yuan wei
  • 5 篇 wang jian
  • 5 篇 rakow p.e.l.
  • 5 篇 perlt h.
  • 5 篇 schierholz g.
  • 5 篇 muller michael
  • 5 篇 yung moti
  • 5 篇 rajsbaum sergio
  • 5 篇 philipsen owe
  • 5 篇 sandholm tuomas
  • 5 篇 herlihy maurice
  • 5 篇 raz ran
  • 5 篇 procaccia ariel ...
  • 5 篇 horsley r.
  • 5 篇 fraigniaud pierr...
  • 5 篇 kushilevitz eyal
  • 5 篇 bournez olivier

语言

  • 5,715 篇 英文
  • 68 篇 其他
  • 23 篇 中文
  • 5 篇 西班牙文
  • 4 篇 法文
  • 4 篇 日文
  • 3 篇 俄文
  • 2 篇 德文
  • 1 篇 意大利文
  • 1 篇 朝鲜文
  • 1 篇 葡萄牙文
检索条件"主题词=computation theory"
5827 条 记 录,以下是71-80 订阅
排序:
PERIODIC SETS OF INTEGERS
收藏 引用
THEORETICAL COMPUTER SCIENCE 1994年 第2期127卷 287-312页
作者: MATOS, AB Centro de Inform&aacute tica de Universidade do Porto Rua do Campo Alegre 823 4100 Porto Portugal
Consider the following kinds of sets: the set of all possible distances between two vertices of a directed graph;any set of integers that is either finite or periodic for all n greater or equal to some no (such a set ... 详细信息
来源: 评论
ON FINDING COMMON SUBTREES
收藏 引用
THEORETICAL COMPUTER SCIENCE 1993年 第2期108卷 345-356页
作者: GROSSI, R Dipartimento di Informatica Universit&agrave di Pisa Corso Italia 40 56125 Pisa Italy
Let T and R be two arbitrary ordered trees, \T\ greater-than-or-equal-to \R\, whose nodes are labelled over an alphabet A. We devise a simple solution for detecting all the common subtrees in O(\T\) time and space if ... 详细信息
来源: 评论
DECIDING WHETHER A FINITE-SET OF WORDS HAS RANK AT MOST 2
收藏 引用
THEORETICAL COMPUTER SCIENCE 1993年 第2期112卷 311-337页
作者: NERAUD, J LIR LITP Institut Blaise Pascal Universit&eacute de Rouen Facult&eacute des Sciences Place Emile Blondel F-76134 Mont-Saint-Aignan France
Given a finite subset X of a free monoid A*, we define the rank of X as r(X) = min {Absolute value of Y: X subset-or-equal-to Y*}. The problem we study here is to decide whether or not r(X) less-than-or-equal-to 2. We... 详细信息
来源: 评论
100 years of Zermelo's axiom of choice:: what was the problem with it?
收藏 引用
COMPUTER JOURNAL 2006年 第3期49卷 345-350页
作者: Martin-Löf, P
Cantor conceived set theory in a sequence of six papers published in theMathematische Annalen during the five year period 1879-1884. In the fifth of these papers, publishedin 1883, he stated as a law of thought (Denkg... 详细信息
来源: 评论
The interpretation of discrete dislocation dynamics simulation data: verification and validation (V&V) with application to size/scale effects and free surface effects
收藏 引用
JOURNAL OF MATERIALS SCIENCE 2024年 第12期59卷 4810-4828页
作者: Li, Luo Khraishi, Tariq Univ New Mexico Mech Engn Dept Albuquerque NM 87131 USA
Simulation models are used to emulate real-world phenomena, and errors are inevitable in the numerical computation process. Owing to that, simulation models need to be verified and validated to ensure the models and t... 详细信息
来源: 评论
On mobile agent verifiable problems
收藏 引用
INFORMATION AND computation 2018年 第0期260卷 51-71页
作者: Bampas, Evangelos Ilcinkas, David Aix Marseille Univ LIS Marseille France CNRS Marseille France CNRS LaBRI Bordeaux France Univ Bordeaux Bordeaux France
We consider decision problems that are solved in a distributed fashion by synchronous mobile agents operating in an unknown, anonymous network. Each agent has a unique identifier and an input string and they have to d... 详细信息
来源: 评论
LEED EVALUATION OF 3 MODELS OF THE SI SURFACE
收藏 引用
VACUUM 1983年 第10-1期33卷 627-632页
作者: JONES, GJR HOLLAND, BW Department of Physics University of Warwick Coventry CV4 7AL UK
A strong body of opinion has recently favoured the buckled dimer type of model for the Si{100} surface and we compare LEED calculations for two such models with experiment. The first model is that of Yin and Cohen whi... 详细信息
来源: 评论
The Boole Lecture -: A very mathematical dilemma
收藏 引用
COMPUTER JOURNAL 2006年 第4期49卷 480-486页
作者: Bundy, Alan Univ Edinburgh Sch Informat Edinburgh EH8 9YL Midlothian Scotland
The Annual Boole Lecture was established and is sponsored by the Boole Centre for Research in Informatics, the Cork Constraint computation Centre, the Department of Computer Science, and the School of Mathematics, App... 详细信息
来源: 评论
Symbolic computation with sequences
收藏 引用
PROGRAMMING AND COMPUTER SOFTWARE 2006年 第2期32卷 65-70页
作者: Petkovsek, M Univ Ljubljana Fac Math & Phys Dept Math SI-1000 Ljubljana Slovenia
We present several classes of univariate sequences and sketch some algorithms for computing with sequences from these classes.
来源: 评论
MEMCOMPUTING: WHEN MEMORY BECOMES A COMPUTING TOOL
收藏 引用
PHYSICS TODAY 2022年 第11期75卷 35-40页
作者: Di Ventra, Max Univ Calif San Diego CA USA
A physical system that retrieves information from the past and acts on it appropriately can efficiently solve difficult combinatorial-optimization problems.
来源: 评论