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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

17 篇 会议
2 篇 期刊文献

馆藏范围

19 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17 篇 工学
- 16 篇 计算机科学与技术...
- 3 篇 软件工程
- 2 篇 电气工程
- 2 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 测绘科学与技术
7 篇 理学
- 6 篇 数学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...

主题

3 篇 graph theory
3 篇 automata theory
1 篇 network protocol...
1 篇 polynomial appro...
1 篇 hamiltonians
1 篇 set theory
1 篇 approximation th...
1 篇 computer program...
1 篇 game theory
1 篇 computer program...
1 篇 interactive comp...
1 篇 random processes

机构

1 篇 turku univ dept ...
1 篇 university of ge...
1 篇 university of aa...
1 篇 masaryk universi...
1 篇 jagiellonian uni...
1 篇 tohoku univ grad...
1 篇 slovak tech univ...
1 篇 univ liverpool d...
1 篇 university of aa...
1 篇 frank valencia e...
1 篇 univ e anglia sc...
1 篇 czech technical ...
1 篇 charles universi...
1 篇 gdansk univ tech...
1 篇 univ kassel fach...
1 篇 univ paris 07 li...
1 篇 fact wiskunde in...
1 篇 department of ap...
1 篇 institute of com...
1 篇 rhein westfal th...

作者

1 篇 nakamura tomoyuk...
1 篇 kosik matej
1 篇 spillner andreas
1 篇 lekavy marian
1 篇 antti-poika teem...
1 篇 roman adam
1 篇 navrat pavol
1 篇 dabrowski jacek
1 篇 palamidessi catu...
1 篇 nagy benedek
1 篇 ishino akira
1 篇 kučera antonín
1 篇 shinohara ayumi
1 篇 sanguineti marce...
1 篇 orponen pekka
1 篇 miltersen peter ...
1 篇 inenaga shunsuke
1 篇 matsubara wataru
1 篇 preneel bart
1 篇 šíma jiří

语言

19 篇 英文

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

共 19 条记录，以下是1-10 订阅

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

详细简洁

排序：

sofsem 2008: theory and practice of computer science - 34th conference on current trends in theory and practice of computer science Proceedings

SOFSEM 2008: Theory and Practice of Computer Science - 34th ...

引用

sofsem 2008 - 34th conference on current trends in theory and practice of computer science

ISBN: (纸本)354077565X

the proceedings contain 66 papers. the topics discussed include: quantum random walks-new method for designing quantum algorithms;social information access: the other side of the social web;designing adaptive web applications;best of both: using semantic web technologies to enrich user interaction with the web and vice versa;on the hardness of reoptimization;describing self-assembly of nanostructures;on the undecidability of the tiling problem;remote entrusting by run-time software authentication;trusted computing-special aspects and challenges;optimizing winning strategies in regular infinite games;recursive domain equations of filter models;algorithmic problems for metrics on permutation groups;and periodic and infinite traces in matrix semigroups.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

49th International conference on current trends in theory and practice of computer science, sofsem 2024

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

引用

49th International conference on current trends in theory and practice of computer science, sofsem 2024

ISBN: (纸本)9783031521126

the proceedings contain 34 papers. the special focus in this conference is on current trends in theory and practice of computer science. the topics include: Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs;query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages;row-Column Combination of Dyck Words;group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures;on the Parameterized Complexity of the Perfect Phylogeny Problem;data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles;visualization of Bipartite Graphs in Limited Window Size;outerplanar and Forest Storyplans;word-Representable Graphs from a Word’s Perspective;the Information Extraction Framework of Document Spanners - A Very Informal Survey;automata Classes Accepting Languages Whose Commutative Closure is Regular;complexity of Spherical Equations in Finite Groups;the Weighted HOM-Problem Over Fields;combinatorics of Block-Parallel Automata Networks;on the Computational Complexity of Generalized Common Shape Puzzles;new Support Size Bounds and Proximity Bounds for Integer Linear Programming;the Complexity of Cluster Vertex Splitting and Company;morphing Graph Drawings in the Presence of Point Obstacles;the Complexity of Online Graph Games;removable Online Knapsack with Bounded Size Items;shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching;generalized Distance Polymatrix Games;distance Labeling for Families of Cycles;relaxed Agreement Forests;apportionment with thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode;positive Characteristic Sets for Relational Pattern Languages;on the Parameterized Complexity of Minus Domination;preface;local Certification of Majority Dynamics;parameterized Algorithms for Covering by Arithmetic Progressions;faster Winner Determination Algo

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generation of Cycle Permutation Graphs and Permutation Snarks 50th

Generation of Cycle Permutation Graphs and Permutation Sna...

引用

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

作者： Goedgebeur, Jan Renders, Jarne Department of Computer Science KU Leuven Kulak Kortrijk8500 Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium

ISBN: (纸本)9783031826696

We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a 2-factor consisting of two chordless cycles, and non-hamiltonian cycle permutation graphs, from which the permutation snarks can easily be computed. this allows us to generate all cycle permutation graphs up to order 34 and all permutation snarks up to order 46, improving upon previous computational results by Brinkmann et al. Moreover, we give several improved lower bounds for interesting permutation snarks, such as for a smallest permutation snark of order 6mod8 or a smallest permutation snark of girth at least 6. these computational results also allow us to complete a characterisation of the orders for which non-hamiltonian cycle permutation graphs exist, answering an open question by Klee from 1972, and yield many more counterexamples to a conjecture by Zhang. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Parallel immune system for graph coloring 1

引用

34th conference on current trends in theory and practice of computer science

作者： Dabrowski, Jacek Gdansk Univ Technol PL-80952 Gdansk Poland

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

this paper presents a parallel artificial immune system designed for graph coloring. the algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and a migration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. the experiments were performed using a high performance cluster on a set of well-established graph instances available on the Web.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Optimizing winning strategies in regular infinite games 1

引用

34th conference on current trends in theory and practice of computer science

作者： thomas, Wolfgang Rhein Westfal TH Aachen D-52056 Aachen Germany

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

We consider infinite two-player games played on finite graphs where the winning condition (say for the first player) is given by a regular omega-language. We address issues of optimization in the construction of winning strategies in such games. Two criteria for optimization are discussed: memory size of finite automata that execute winning strategies, and - for games with liveness requests as winning conditions - "waiting times" for the satisfaction of requests. (For the first aspect we report on work of Holtmann and Loding, for the second on work of Horn., Wallmeier, and the author.)

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

On reachability games of ordinal length 1

引用

34th conference on current trends in theory and practice of computer science

作者： Cristau, Julien Horn, Florian Univ Paris 07 LIAFA F-75251 Paris 05 France

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

Games are a classical model in the synthesis of controllers in the open setting. In particular, games of infinite length can represent systems which are not expected to reach a correct state, but rather to handle a continuous stream of events. Yet, even longer sequences of events have to be considered when infinite sequences of events can occur in finite time - Zeno behaviours. In this paper, we extend two-player games to this setting by considering plays of ordinal length. Our two main results are determinacy of reachability games of length less than w(w) on finite arenas, and the PSPACE-completeness of deciding the winner in such a game.

关键词： Interactive computer graphics

来源：评论

学校读者我要写书评

暂无评论

Periodic and infinite traces in matrix semigroups 1

引用

34th conference on current trends in theory and practice of computer science

作者： Bell, Paul Potapov, Igor Turku Univ Dept Math Turku Finland Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's correspondence problem to be undecidable and show its application to matrix semigroup problems, such as Any Diagonal Matrix Problem and Recurrent Matrix Problem. We also use infinite periodic traces in counter automaton models to show the undecidability of a new variation of the Infinite Post Correspondence Problem and Vector Ambiguity Problem for matrix semigroups.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Taming of Pict 1

引用

34th conference on current trends in theory and practice of computer science

作者： Kosik, Matej Slovak Univ Technol Bratislava Fac Informat & Informat Technol Bratislava Slovakia

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

this article presents additional necessary measures that enable us to use Pict as an object-capability programing language. It is desirable to be able to assess the worst possible threat that we-users-risk if we run a given program. If we know the threat, we are able to decide whether or not we are willing to risk running the program. the cost of a security audit that reveals such an assessment will be non-zero but it need not to be directly dependent on the size of the whole original program. It is possible to write programs in such a way that this analysis can be reliably performed on a fraction of the original program-on the trusted computing base. this technique does not always give the most accurate assessment but it gives sound and interesting assessment relatively cheaply. It does not prevent usage of other techniques that can further refine the initial assessment.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

An automata theoretic approach to rational tree relations 1

引用

34th conference on current trends in theory and practice of computer science

作者： Radmacher, Frank G. Rhein Westfal TH Aachen Lehrstuhl Informat 7 Aachen Germany

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions by Raoult (Bull. Belg. Math. Sec. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. the automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness problem). the second contribution of this paper is a new subclass of the rational tree relations, called separate-rational tree relations, defined via a natural restriction on asynchronous tree automata. these relations are closed under composition, preserve regular tree languages, and generate precisely the regular sets in the unary case (all these properties fail for the general model), and they are still more powerful than, for instance, the automatic tree relations.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Extension of rescheduling based on minimal graph cut 1

引用

34th conference on current trends in theory and practice of computer science

作者： Lekavy, Marian Navrat, Pavel Slovak Tech Univ Bratislava Fac Informat & Informat Technol Bratislava 84216 Slovakia

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

An important role of a workflow system is to schedule and reschedule the workflow process and to allow the user to monitor and guide the overall progress of the workflow and its activities. this paper presents extensions of a rescheduling algorithm based on minimal graph cut. the initial approach allowed to find an optimal rescheduling, which changed the initial schedule by shortening and moving of activities. the new schedule had the lowest overall price, counted as the sum of prices of shortening activities. the extension presented in this paper allows several extensions, while keeping the optimality: handling several delayed activities, handling the price of moving an activity and handling the price of deadline violation. the rescheduling algorithm is used within an ontology-based workflow management system for the process of military exercise preparation in Centre of simulation technologies National Academy of Defence.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：