检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

216 篇 会议
19 册 图书
7 篇 期刊文献

馆藏范围

241 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

150 篇 工学
- 139 篇 计算机科学与技术...
- 59 篇 软件工程
- 17 篇 信息与通信工程
- 15 篇 电气工程
- 8 篇 控制科学与工程
- 4 篇 化学工程与技术
- 3 篇 建筑学
- 3 篇 土木工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
- 2 篇 生物医学工程（可授...
66 篇 理学
- 51 篇 数学
- 9 篇 物理学
- 6 篇 统计学（可授理学、...
- 5 篇 生物学
- 5 篇 系统科学
- 4 篇 化学
18 篇 管理学
- 12 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
6 篇 教育学
- 6 篇 教育学
3 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
- 2 篇 药学(可授医学、理...
1 篇 文学
- 1 篇 新闻传播学

主题

13 篇 graph theory
11 篇 artificial intel...
9 篇 discrete mathema...
8 篇 automata theory
7 篇 theory of comput...
7 篇 software enginee...
6 篇 complexity theor...
5 篇 computer communi...
5 篇 algorithm analys...
5 篇 information stor...
4 篇 software enginee...
4 篇 database managem...
4 篇 computers
4 篇 game theory
4 篇 data structures
4 篇 information retr...
3 篇 computer science
3 篇 turing machines
3 篇 information syst...
3 篇 switches

机构

3 篇 charles universi...
3 篇 university of be...
3 篇 department of in...
2 篇 department of co...
2 篇 school of electr...
2 篇 dept. of compute...
2 篇 warsaw universit...
2 篇 univ utrecht utr...
2 篇 department of ep...
2 篇 department of me...
2 篇 software enginee...
2 篇 school of mathem...
2 篇 school of automa...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 school of eecs o...
2 篇 department of co...
2 篇 department of co...
1 篇 university of ca...

作者

3 篇 mária bieliková
3 篇 van leeuwen jan
3 篇 inenaga shunsuke
3 篇 šíma jiří
3 篇 saurabh saket
2 篇 peleg david
2 篇 bieliková mária
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 paulusma daniel
2 篇 albers susanne
2 篇 kiya hironori
2 篇 rossmanith peter
2 篇 pokorný jaroslav
2 篇 iliopoulos costa...
2 篇 hanaka tesshu
2 篇 jeffery keith g.
2 篇 otto friedrich

语言

238 篇 英文
4 篇 中文

检索条件"任意字段=34th Conference on Current Trends in Theory and Practice of Computer Science"

共 242 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

SOFSEM 2009: theory and practice of computer science-35th conference on current trends in Rheory and practice of computer science,Proceedings

SOFSEM 2009: Theory and Practice of Computer Science-35th Co...

引用

35th conference on current trends in theory and practice of computer science, SOFSEM 2009

ISBN: (纸本)3540958908

the proceedings contain 57 papers. the topics discussed include: a new analysis of expected revenue: combinatorial and simultaneous auctions;can component/service-based systems be proved correct?;probabilitic acceptors for languages over infinite words;automatic verification of heap manipulation using separation logic;randomness and determination, from physics and computing toward biology;when analysis fails: heuristic mechanism design via self-correcting procedures;on compositionality, efficiency, and applicability of abstraction in probabilistic systems;framed versus unframed two-dimensional languages;approximating tree edit distance through string edit distance for binary tree codes;the shortcut problem - complexity and approximation;green computing: energy consumption optimized service hosting;natural specifications yield decidability for distributed synthesis of asynchronous systems;and epistemic strategies and games on concurrent processes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SOFSEM-SRF 2020 - Proceedings of the SOFSEM 2020 Doctoral Student Research Forum, co-located with the 46th International conference on current trends in theory and practice of computer science, SOFSEM 2020

SOFSEM-SRF 2020 - Proceedings of the SOFSEM 2020 Doctoral St...

引用

46th International conference on current trends in theory and practice of computer science Doctoral Student Research Forum, SOFSEM-SRF 2020

the proceedings contain 11 papers. the topics discussed include: exploration of MSC trees using genetic algorithms;bit-layers text encoding for efficient text processing;fast-insertion-sort: a new family of efficient variants of the insertion-sort algorithm;grammars and a random generator for deterministic chain regular expressions;early prediction of test case verdict with word embeddings vs. bag-of-words;an extension of linear-size suffix tries for parameterized strings;data-driven powertrain component aging prediction using in-vehicle signals;and a graph-based tool to embed the π-calculus into a computational DPO framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

46th International conference on current trends in theory and practice of computer science, SOFSEM 2020

46th International Conference on Current Trends in Theory an...

引用

46th International conference on current trends in theory and practice of computer science, SOFSEM 2020

ISBN: (纸本)9783030389185

the proceedings contain 60 papers. the special focus in this conference is on current trends in theory and practice of computer science. the topics include: Faster STR-EC-LCS Computation;kernels of Sub-classes of Context-Free Languages;minimal Unique Substrings and Minimal Absent Words in a Sliding Window;on Synthesis of Specifications with Arithmetic;on the Average State Complexity of Partial Derivative Transducers;on the Difference Between Finite-State and Pushdown Depth;online Scheduling with Machine Cost and a Quadratic Objective Function;parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching;parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems;the Lost Recipes from the Four Schools of Amathus: Invited Talk Extended Abstract;parameterized Dynamic Variants of Red-Blue Dominating Set;refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs;simple Distributed Spanners in Dense Congest Networks;the Order Type of Scattered Context-Free Orderings of Rank One Is Computable;up-to Techniques for Branching Bisimilarity;crowd Detection for Drone Safe Landing through Fully-Convolutional Neural Networks;explaining Single Predictions: A Faster Method;inferring Deterministic Regular Expression with Unorder;POI Recommendation Based on Locality-Specific Seasonality and Long-Term trends;selection of a Green Logical Data Warehouse Schema by Anti-monotonicity Constraint;sharing Energy for Optimal Edge Performance;the HyperBagGraph DataEdron: An Enriched Browsing Experience of Datasets: Track: Foundation of Data science and Engineering;towards the Named Entity Recognition Methods in Biomedical Field;vietnamese Punctuation Prediction Using Deep Neural Networks;a Light-Weight Tool for the Self-assessment of Security Compliance in Software Development – An Industry Case;Do People Use Naming Conventions in SQL Programming?.

关键词：

来源：评论

学校读者我要写书评

暂无评论

44th International conference on current trends in theory and practice of computer science, SOFSEM 2018

44th International Conference on Current Trends in Theory an...

引用

44th International conference on current trends in theory and practice of computer science, SOFSEM 2018

ISBN: (纸本)9783319731162

the proceedings contain 48 papers. the special focus in this conference is on current trends in theory and practice of computer science. the topics include: Combining versioning and metamodel evolution in the chronosphere model repository;automated change propagation from source code to sequence diagrams;multi-paradigm architecture constraint specification and configuration based on graphs and feature models;lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test;computational complexity of atomic chemical reaction networks;conjugacy of one-dimensional one-sided cellular automata is undecidable;formal verification and safety assessment of a hemodialysis machine;automatic decomposition of Java open source pull requests: A replication study;Transformation of OWL2 property axioms to groovy;on architecture specification;simple paths and cycles avoiding forbidden paths;external memory algorithms for finding disjoint paths in undirected graphs;on range and edge capacity in the congested clique;Global vs. local semantics of BPMN 2.0 OR-join;AODVv2: Performance vs. loop freedom;multivendor deployment integration for future mobile networks;patrolling a path connecting a set of points with unbalanced frequencies of visits;exploring graphs with time constraints by unreliable collections of mobile robots;the k-server problem with advice in d dimensions and on the sphere;Deciding universality of ptNFAs is PSpace-complete;the state of the art in dynamic graph algorithms;theoretical aspects of symbolic automata;Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial ODE’S;influence of body postures on touch-based biometric user authentication;runtime distributions and criteria for restarts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

30th conference on current trends in theory and practice of computer science, SOFSEM 2004

引用

30th conference on current trends in theory and practice of computer science, SOFSEM 2004

ISBN: (纸本)3540207791

the proceedings contain 32 papers. the special focus in this conference is on theory and practice of computer science. the topics include: Database research issues in a www and grids world;integration, diffusion, and merging in information management discipline;flexibility through multiagent systems;supporting users in search and navigation;querying and viewing the semantic web;knowledge acquisition and processing;algorithms for scalable storage servers;fuzzy unification and argumentation for well-founded semantics;tree signatures and unordered xml pattern matching;quantum query complexity for some graph problems;design of secure multicast models for mobile services;some notes on the complexity of protein similarity search under MRNA structure constraints;measures of intrinsic hardness for constraint satisfaction problem instances;validity conditions in agreement problems and time complexity;supporting evolution in workflow definition languages;discovery of lexical entries for non-taxonomic relations in ontology learning;approaches based on Markovian architectural bias in recurrent neural networks;an embedded language approach to router specification in curry;multi-document automatic text summarization using entropy estimates;implicit flow maximization by iterative squaring;evolving constructors for infinitely growing sorting networks and medians;fuzzy group models for adaptation in cooperative information retrieval contexts;avoiding forbidden submatrices by row deletions and building a bridge between mirror neurons and theory of embodied cognition.

关键词：

来源：评论

学校读者我要写书评

暂无评论

45th International conference on current trends in theory and practice of computer science, SOFSEM 2018

45th International Conference on Current Trends in Theory an...

引用

45th International conference on current trends in theory and practice of computer science, SOFSEM 2018

ISBN: (纸本)9783030108007

the proceedings contain 40 papers. the special focus in this conference is on current trends in theory and practice of computer science. the topics include: Phase transition in matched formulas and a heuristic for biclique satisfiability;on infinite prefix normal words;priority scheduling in the Bamboo garden trimming problem;patrolling on dynamic ring networks;gathering of robots in a grid with mobile faults;probabilistic parameterized polynomial time;on matrix ins-del systems of small sum-norm;separation logic with linearly compositional inductive predicates and set data constraints;on the complexity of optimal matching reconfiguration;forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs;distance-based community search (invited talk extended abstract);existence versus exploitation: the opacity of backdoors and backbones under a weak assumption;on point set embeddings for k-planar graphs with few bends per edge;enumerating connected induced subgraphs: Improved delay and experimental comparison;multi-stranded string assembling systems;towards automatic comparison of cloud service security certifications;On the expressive power of GF(2)-grammars;an efficient algorithm for combining verification and validation methods;robustness radius for chamberlin-courant on restricted domains;on the complexity of color-avoiding site and bond percolation;lackadaisical quantum walks with multiple marked vertices;minicomplexity: Some motivation, some history, and some structure (invited talk extended abstract);a 116/13-approximation algorithm for l(2, 1)-labeling of unit disk graphs;minimizing the cost of team exploration;two-head finite-state acceptors with translucent letters;do null-type mutation operators help prevent null-type faults?;towards combining multitask and multilingual learning;on the size of logical automata.

关键词：

来源：评论

学校读者我要写书评

暂无评论

47th International conference on current trends in theory and practice of computer science, SOFSEM 2021

47th International Conference on Current Trends in Theory an...

引用

47th International conference on current trends in theory and practice of computer science, SOFSEM 2021

ISBN: (纸本)9783030677305

the proceedings contain 44 papers. the special focus in this conference is on current trends in theory and practice of computer science. the topics include: Concatenation Operations and Restricted Variants of Two-Dimensional Automata;distance Hedonic Games;distributed Independent Sets in Interval and Segment Intersection Graphs;hierarchical b-Matching;improved Algorithms for Online Load Balancing;iterated Uniform Finite-State Transducers on Unary Languages;new Bounds on the Half-Duplex Communication Complexity;novel Results on the Number of Runs of the Burrows-Wheeler-Transform;on the Redundancy of D-Ary Fano Codes;towards Knowledge Exchange: State-of-the-Art and Open Problems;on the Terminal Connection Problem;parameterized Complexity of d-Hitting Set with Quotas;parameterizing Role Coloring on Forests;the Balanced Satisfactory Partition Problem;the Multiple Traveling Salesman Problem on Spiders;tightness of Sensitivity and Proximity Bounds for Integer Linear Programs;using the Metro-Map Metaphor for Drawing Hypergraphs;weighted Microscopic Image Reconstruction;A Normal Sequence Compressed by PPM ∗ But Not by Lempel-Ziv 78;clusters of Repetition Roots: Single Chains;invited Talk: Resilient Distributed Algorithms;drawing Two Posets;fair Division Is Hard Even for Amicable Agents;the Complexity of Flow Expansion and Electrical Flow Expansion;an Infrastructure for Platform-Independent Experimentation of Software Changes;using Process Models to Understand Security Standards;web Test Automation: Insights from the Grey Literature;a Pipeline for Measuring Brand Loyalty through Social Media Mining;predicting Tennis Match Outcomes with Network Analysis and Machine Learning;role-Based Access Control on Graph Databases;Semi-automatic Column Type Inference for CSV Table Understanding;towards Minimally Conscious Cyber-Physical Systems: A Manifesto.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2004: theory and practice of computer science: 30th conference on current trends in theory and practice of computer science Měřín, Czech Republic, January 24-30, 2004 Proceedings 1

引用

丛书名： Lecture Notes in computer science 2932

2004年

作者： H. J. van den Herik H. H. L. M. Donkers (auth.) Peter Van Emde Boas Jaroslav Pokorný Mária Bieliková Július à tuller (eds.)

来源：评论

学校读者我要写书评

暂无评论

Holey Graphs: Very Large Betti Numbers are Testable 50th

Holey Graphs: Very Large Betti Numbers are Testable

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Szabó, Dániel Apers, Simon Université Paris Cité CNRS IRIF Paris France

ISBN: (纸本)9783031826962

We show that the graph property of having a (very) large k-th Betti number βk (over Z2) for constant k is testable with a constant number of queries in the dense graph model. More specifically, we consider a clique complex defined by an underlying graph and prove that for any Ε>0, there exists δ(Ε,k)>0 such that testing whether βk≥(1-δ)dk for δ≤δ(Ε,k) reduces to tolerantly testing (k+2)-clique-freeness, which is known to be testable. this complements a result by Elek (2010) showing that Betti numbers are testable in the bounded-degree model. For our result we consider simplicial complexes as combinatorial objects, and combine matroid theory and the graph removal lemma. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

the Computational Complexity of Equilibria with Strategic Constraints 50th

The Computational Complexity of Equilibria with Strategic ...

引用

50th International conference on current trends in theory and practice of computer science, SOFSEM 2025

作者： Kapron, Bruce M. Samieefar, Koosha Department of Computer Science University of Victoria Victoria Canada

ISBN: (纸本)9783031826962

Computational aspects of equilibrium notions for games have been extensively studied, including settings where the goal is to find an equilibrium that possesses some additional properties. Our work extends this direction by considering games in which players are subject to some form of constraint on their strategic choices. We also consider the relationship between Nash equilibria and so-called generalized or social equilibria in this context. Our results demonstrate that the complexity of finding an equilibrium varies significantly between games with slightly different strategic constraints. We also demonstrate that these constraints are useful for modeling problems involving strategic resource allocation and also are of interest from the perspective of behavioral game theory. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共25页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：