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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

188 篇 会议
15 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

3 篇 university of be...
2 篇 department of co...
2 篇 charles universi...
2 篇 department of co...
2 篇 dept. of compute...
2 篇 warsaw universit...
2 篇 dept. of compute...
2 篇 school of comput...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 university of am...
2 篇 department of in...
2 篇 central universi...
2 篇 department of co...
2 篇 school of comput...
1 篇 university of ca...
1 篇 faculty of elect...
1 篇 cern 1 esplanade...
1 篇 ist austria klos...

作者

3 篇 van leeuwen jan
3 篇 šíma jiří
3 篇 saurabh saket
2 篇 peleg david
2 篇 zhaoquan gu
2 篇 bieliková mária
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 mária bieliková
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 shaohua wang
2 篇 paulusma daniel
2 篇 inenaga shunsuke
2 篇 xinchen wang
2 篇 kiya hironori
2 篇 rossmanith peter
2 篇 wiedermann jiri
2 篇 pokorný jaroslav
2 篇 iliopoulos costa...

语言

206 篇 英文
4 篇 中文

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

共 210 条记录，以下是131-140 订阅

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

详细简洁

排序：

A macro-level model for investigating the effect of directional bias on network coverage 38th

A macro-level model for investigating the effect of directio...

引用

Proceedings of the 38th Australasian computer science conference, ACSC 2015

作者： Smith, Graeme Sanders, J.W. Li, Qin School of Information Technology and Electrical Engineering The University of Queensland Australia African Institute for Mathematical Science South Africa Department of Mathematical Sciences Stellenbosch University South Africa East China Normal University Shanghai China

ISBN: (纸本)9781921770418

Random walks have been proposed as a simple method of effciently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random walks that are biased towards their current heading. In this paper, we investigate whether or not complementing random walks with directional bias can decrease the expected discovery and coverage times in networks. To do so, we develop a macro-level model of a directionally biased random walk based on Markov chains. By focussing on regular, connected networks, the model allows us to effciently calculate expected coverage times for different network sizes and biases. Our analysis shows that directional bias can significantly reduce coverage time, but only when the bias is below a certain value which is dependent on the network size. © 2015, Australian computer Society, Inc.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium 46th

Two-Player Competitive Diffusion Game: Graph Classes and the...

引用

46th International conference on current trends in theory and practice of Informatics (SOFSEM)

作者： Fukuzono, Naoka Hanaka, Tesshu Kiya, Hironori Ono, Hirotaka Yamaguchi, Ryogo Nagoya Univ Grad Sch Informat Chikusa Ku Furo Cho Nagoya Aichi Japan Chuo Univ Dept Informat & Syst Engn Bunkyo Ku 1-13-27Kasuga Tokyo Japan Dev Bank Japan Tokyo Japan

ISBN: (纸本)9783030389192;9783030389185

the competitive diffusion game is a game-theoretic model of information spreading on a graph proposed by Alon et al. (2010). In the model, a player chooses an initial vertex of the graph, from which information by the player spreads through the edges connected with the initial vertex. If a vertex that is not yet influenced by any information receives information by a player, it is influenced by the information and it diffuses it to adjacent vertices. A vertex that simultaneously receives two or more types of information does not diffuse any type of information from then on. the objective of a player is to maximize the number of vertices influenced by the player's information. In this paper, we investigate the existence of a pure Nash equilibrium of the two-player competitive diffusion game on chordal and its related graphs. We show that a pure Nash equilibrium always exists on block graphs, split graphs and interval graphs, all of which are well-known subclasses of chordal graphs. On the other hand, we show that there is an instance with no pure Nash equilibrium on (strongly) chordal graphs;the boundary of the existence of a pure Nash equilibrium is found.

关键词： Nash equilibrium Competitive diffusion game Algorithmic game theory Chordal graph

来源：评论

学校读者我要写书评

暂无评论

26th conference on current trends in theory and practice of Informatics, SOFSEM 1999

26th Conference on Current Trends in Theory and Practice of ...

引用

26th conference on current trends in theory and practice of Informatics, SOFSEM 1999

ISBN: (纸本)354066694X

the proceedings contain 37 papers. the special focus in this conference is on trends in theory and Core Technologies. the topics include: Quantum challenges;stability of approximation algorithms for hard optimization problems;algorithms on compressed strings and arrays;WWW based collaboration with the BSCW system;middleware and quality of service;dynamic reconfiguration of CORBA-based applications;fast, error correcting parser combinators;java based business components, and new tools to develop applications;databases and the world wide web;exploiting formality in software engineering;biomolecular computing and programming;software change and evolution;distributed simulation with cellular automata;supporting group-by and pipelining in bitmap-enabled query processors;on interactive computation;coherent concepts, robust learning;application of artificial neural networks for different engineering problems;a new structure for pattern matching;principles of forecasting;quantum finite multitape automata;decomposable bulk synchronous parallel computers;component change and version identification in SOFA;pattern equations and equations with stuttering;garbage collection for mobile and replicated objects;randomized gossiping by packets in faulty networks;simulation problems for one-counter machines;on semantics of petri nets over partial algebra;towards possibilistic decision functions with minimum-based sugeno integrals;quantum finite one-counter automata;a performance comparison of mobile agents and RPC;cyclic cutwidth of the mesh;some afterthoughts on hopfield networks;a persistent-set approach to abstract state-space construction in verification;computational power of neuroidal nets and cellular automata with dynamically reconfigurable buses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2011: theory and practice of computer science 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Ivana Černá Tibor Gyimóthy Juraj Hromkovič Keith Jefferey Rastislav Králović Marko Vukolić Stefan Wolf

ISBN: (数字)9783642183812

ISBN: (纸本)9783642183805

this book constitutes the refereed proceedings of the 37th conference on current trends in theory and practice of computer science, SOFSEM 2011, held in Nový, Smokovec, Slovakia in January 2011. the 41 revised full papers, presented together with 5 invited contributions, were carefully reviewed and selected from 122 submissions. SOFSEM 2011 was organized around the following four tracks: foundations of computer science; software, systems, and services; processing large datasets; and cryptography, security, and trust.

关键词： Algorithm Analysis and Problem Complexity Software Engineering Data Storage Representation Discrete Mathematics in computer science computer Communication Networks Database Management

来源：评论

学校读者我要写书评

暂无评论

How can computer science contribute to knowledge discovery? 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Watanabe, Osamu Dept. of Mathematical and Computing Sciences Tokyo Institute of Technology Japan

ISBN: (纸本)9783540429128

Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields including computer science. Good softwares have been demanded for various knowledge discovery tasks. For such softwares, we often need to develop efficient algorithms for handling huge data sets. Random sampling is one of the important algorithmic methods for processing huge data sets. In this paper, we explain some random sampling techniques for speeding up learning algorithms and making them applicable to large data sets [15,16,4,3]. We also show some algorithms obtained by using these techniques. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

Fast, error correcting parser combinators: A short tutorial 26th

Fast, error correcting parser combinators: A short tutorial

引用

26th conference on current trends in theory and practice of Informatics, SOFSEM 1999

作者： Doaitse Swierstra, S. Azero Alcocer, Pablo R. Department of Computer Science Utrecht University TB Utrecht P. O. Box 80.089 Netherlands Univeridad Major de San Simon Cochabamba Bolivia

ISBN: (纸本)354066694X

Compiler writers have always heavily relied on tools: parser generators for generating parsers out of context free grammars, attribute grammar systems for generating semantic analyzers out of attribute grammars, and systems for generating code generators out of descriptions of machine architectures. Since designing such special formalisms and constructing such tools deals with one of the most important issues in computer science, courses on compiler construction have always formed part of the core computer science curriculum.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the reconstruction of polyominoes from approximately orthogonal projections 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Gębala, Maciej Institute of Mathematics Opole University Poland Institute of Computer Science University of Wroclaw Przesmyckiego 20 Wroclaw51-151 Poland

ISBN: (纸本)9783540429128

the reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will prove that it is NPcomplete if we reconstruct polyominoes, horizontal convex polyominoes and vertical convex polyominoes. Moreover we will give the polynomial algorithm for the reconstruction of hv-convex polyominoes that has time complexity O(m3n3). © Springer-Verlag Berlin Heidelberg 2001.

关键词： Medical problems

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2013: theory and practice of computer science 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Peter Emde Boas Frans C. A. Groen Giuseppe F. Italiano Jerzy Nawrocki Harald Sack

ISBN: (数字)9783642358432

ISBN: (纸本)9783642358425

this book constitutes the refereed proceedings of the 39th International conference on current trends in theory and practice of computer science, SOFSEM 2013, held in Špindlerův Mlýn, Czech Republic, in January 2013. the 37 revised full papers presented in this volume were carefully reviewed and selected from 98 submissions. the book also contains 10 invited talks, 5 of which are in full-paper length. the contributions are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and social computing and human factors.

关键词： Discrete Mathematics in computer science Algorithm Analysis and Problem Complexity Information Storage and Retrieval Software Engineering Artificial Intelligence Data Structures

来源：评论

学校读者我要写书评

暂无评论

Taming the complexity of inductive logic programming

Taming the complexity of inductive logic programming

引用

36th conference on current trends in theory and practice of computer science, SOFSEM 2010

作者： Železný, Filip Kuželka, Ondřej Faculty of Electrical Engineering Department of Cybernetics Czech Technical University in Prague Technická 2 16627 Prague 6 Czech Republic

ISBN: (纸本)3642050050

Inductive logic programming (ILP) [12] is concerned with the induction of theories from specific examples and background knowledge, using first-order logic representations for all the three ingredients. In its early days some twenty years ago, ILP was perceived as a means for automatic synthesis of logic programs, i.e. Horn clausal theories. current research views ILP algorithms mainly in the context of machine learning [14] and data mining [1]. ILP has enriched both of the two fieds significantly by providing them with formalisms and algorithms for learning (or 'mining') complex pieces of knowledge from non-trivially structured data such as relational databases. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Some notes on the information flow in read-once branching programs 27th

引用

27th conference on current trends in theory and practice of Informatics, SOFSEM 2000

作者： Jukna, Stasys Žák, Stanislav Dept. Of Computer Science University of Frankfurt Frankfurtam Main60054 Germany Institute of Computer Science Academy of Sciences Pod vodárenskou věží 2 Prague 8182 00 Czech Republic

ISBN: (纸本)3540413480

In this paper we describe a lower bounds argument for readonce branching programs which is not just a standard cut-and-paste. the argument is based on a more subtle analysis of the information flow during the individual computations. Although the same lower bound can be also obtained by standard arguments, our proof may be promising because (unlike the cut-and-paste argument) it can potentially be extended to more general models. © Springer-Verlag Berlin Heidelberg 2000.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：